Device and method for producing coefficient seed data used for format conversion, and information-providing medium therefore

ABSTRACT

The present invention relates to an information signal processor and the like preferable for use in the case of converting a format of an image signal or converting an image size. An input image signal Vin ( 525   i  signal) is converted into an output image signal Vout (such as  1080   i  signal, XGA signal, or  525   i  signal for obtaining an image to be displayed in a different magnification). A class code CL is obtained from tap data selectively extracted from the Vin and corresponding to each pixel (pixel at a target position) within a unit pixel block, which constitutes Vout. A coefficient production circuit produces coefficient data for each class, which is used at the time of calculating the pixel data at the target position, based on the coefficient seed data for each class and position information h, v about the target position generated in a position information generation circuit. A calculation circuit provides pixel data y 1  to yp of the target position according to the estimated equation using the tap data xi corresponding to the target position and the coefficient data Wi corresponding to the class code CL.

TECHNICAL FIELD

The present invention relates to an information signal processor, a method for processing an information signal, an image signal processor and an image display apparatus using the same, a device and a method for producing coefficient seed data used in the same, and an information-providing medium, which are preferable for use in the case of, for example, converting a format of an image signal or converting a size of an image.

More specifically, the present invention relates to an information signal processor and the like whereby, when converting a first information signal into a second information signal, position information about a target position in the second information signal is obtained from the information about format or size conversion, and based on the resultant position information, coefficient data of an estimated equation is produced from coefficient seed data, and information data of the target position in the second information signal is obtained using thus-produced coefficient data, thereby allowing a memory for storing a large amount of coefficient data at the time of making conversions into various formats and sizes to be eliminated.

BACKGROUND ART

In order to convert formats or image sizes, it is required to acquire pixel data having a position different from a position of pixel data of an input image signal so as to obtain an output image signal. In this case, the format or the image size thus converted makes a position relationship of the pixel of the output image signal to the pixel of the input image signal univocally determined.

As an example of a format conversion, description will be made as to a case where an input image signal is a 525 i signal and an output image signal is a 1080 i signal. The 525 i signal means an image signal in an interlace system consisting of 525 lines. The 1080 i signal means an image signal in an interlace system consisting of 1080 lines. FIG. 14 shows a positional relationship between the pixels of the 525 i signal and the pixels of the 1080 i signal. Herein, large dots are pixels of the 525 i signal, and small dots are pixels of the 1080 i signal. Solid lines express the positions of pixels in odd fields and broken lines express the positions of pixels in even fields.

When converting the 525 i signal into the 1080 i signal, it is required to obtain a pixel block in the unit of 9×9 of the 1080 i signal in correspondence with each pixel block in the unit of 4×4 of the 525 i signal in the respective odd and even fields.

FIG. 15 shows a position relationship in a vertical direction between the pixels of the 525 i signal and the pixels of the 1080 i signal. In FIG. 15, the numerical value assigned to each pixel of the 1080 i signal means a shortest distance from the pixel of the 525 i signal in a vertical direction. In this case, the interval between the pixels of the 525 i signal in a vertical direction is set to 16. In this manner, each of the numerical values assigned to each pixel of the 1080 i signal shows position information of this pixel in a vertical direction with respect to the pixel of the 525 i signal.

The position information is set to a negative value when the pixel of the 1080 i signal is located at a position upper than the pixel of the 525 i signal (i.e. a pixel located at the shortest distance from this pixel of the 1080 i signal), while it is set to a positive value when the pixel of the 1080 i signal is located at a position lower than the pixel of the 525 i signal. The same thing is applied to the drawing showing a position relationship in a vertical direction between an extended graphics array (XGA) signal, which will be described later, and the 525 i signal.

FIG. 16 shows a position relationship in a horizontal direction between the pixels of the 525 i signal and the pixels of the 1080 i signal. In FIG. 16, the numerical value assigned to each pixel of the 1080 i signal means a shortest distance from the pixel of the 525 i signal in a horizontal direction. In this case, the interval between the pixels of the 525 i signal in a horizontal direction is set to 8. In this manner, each of the numerical values assigned to the pixel of the 1080 i signal shows position information of this pixel in a horizontal direction with respect to the pixel of the 525 i signal.

The position information is set to a negative value when the pixel of the 1080 i signal is located at a position more left to the pixel of the 525 i signal (i.e. a pixel located at the shortest distance from this pixel of the 1080 i signal) while it is set to a positive value when the pixel of the 1080 i signal is at a position more right to the pixel of the 525 i signal. The same thing is applied to the drawing showing a position relationship in a horizontal direction between the XGA signal, which will be described later, and the 525 i signal.

Next, as an example of a format conversion, description will be made as to a case where an input image signal is a 525 i signal and an output image signal is an XGA signal. The XGA signal is an image signal in a progressive system (i.e. non-interlace system) available at a display with a resolution of 1024×768 dots. FIG. 17 shows a positional relationship between the pixels of the 525 i signal and the pixels of the XGA signal. Herein, large dots are pixels of the 525 i signal, and small dots are pixels of the XGA signal. In addition, as to the 525 i signal, solid lines express the positions of pixels in odd fields and broken lines express the positions of pixels in even fields.

When converting the 525 i signal into the XGA signal, it is required to obtain a 8×16 pixel block of the 1080 i signal in correspondence with each 5×5 pixel block of the 525 i signal in the respective odd and even fields.

FIG. 18 shows a position relationship in a vertical direction between the pixels of the 525 i signal and the pixels of the XGA signal. In FIG. 18, each of the numerical values assigned to the pixels of the XGA signal means a shortest distance from the pixel of the 525 i signal in a vertical direction. In this case, the interval between the pixels of the 525 i signal in a vertical direction is set to 16. In this manner, each of the numerical values assigned to the pixels of the XGA signal shows position information of this pixel in a vertical direction with respect to the pixel of the 525 i signal.

FIG. 19 shows a position relationship in a horizontal direction between the pixels of the 525 i signal and the pixels of the XGA signal. In FIG. 19, each of the numerical values assigned to the pixels of the XGA signal means a shortest distance from the pixel of the 525 i signal in a horizontal direction. In this case, the interval between the pixels of the 525 i signal in a horizontal direction is set to 8. In this manner, each of the numerical values assigned to the pixels of the XGA signal shows position information of this pixel in a horizontal direction with respect to the pixel of the 525 i signal.

Although an example of image size conversion is not specifically shown, the position relationship of the pixels of the output image signal to the pixels of the input image signal is uniquely determined, as is the case of the format conversion described above. For example, in the case where the size of an image (magnification of a displayed image) is magnified by 9/4 times in both vertical and horizontal directions, the same position relationship is obtained as the position relationship between the 525 i signal and the 1080 i signal described above.

Conventionally, it has been suggested to employ the following method at the time when pixel data of an output image signal is to be obtained from pixel data of an input image signal in order to convert formats or image sizes. That is, coefficient data of an estimated equation corresponding to each position of the pixel of the output image signal with respect to the pixel of the input image signal is stored in a memory. Then, by use of thus-obtained coefficient data, pixel data of the output image signal is obtained by the estimated equation.

As described above, if the format or the image size is different between before and after the conversion, then the position relationship of the pixels of the output image signal to the pixels of the input image signal becomes different between before and after conversion accordingly. For this reason, in an apparatus in which a memory stores coefficient data of an estimated equation, when conversions into various formats or sizes are performed, it is required to store coefficient data into the memory in correspondence with each format or size. In such a case, it is required to install a memory capable of storing a large amount of coefficient data. This causes inconvenience that the conversion apparatus becomes expensive, and the like.

DISCLOSURE OF INVENTION

An objective of the present invention is to provide an information signal processor and the like which allows a memory for storing a large amount of coefficient data in order to make conversions into various formats or sizes to be eliminated.

An information signal processor in accordance with the present invention for converting a first information signal including a plurality of information data into a second information signal including a plurality of information data, comprises conversion information input means for inputting conversion information about a format or size conversion, information means for converting the conversion information input by the conversion information input means into position information about a target position in the second information signal, first memory means for storing coefficient seed data, the coefficient seed data being coefficient data in production equation for producing coefficient data to be used in an estimated equation and said production equation using the position information as a parameter, coefficient data generation means for generating the coefficient data to be used in the estimated equation corresponding to the position information about the target position, the coefficient data in the estimated equation being produced according to the production equation using the coefficient seed data stored in the first memory means and the position information about the target position obtained as a result of conversion in the information conversion means, first data selection means for selecting a plurality of first information data located in periphery of the target position in the second information signal, based on the first information signal, and calculation means for calculating and obtaining information data of the target position based on the estimated equation using the coefficient data generated in the coefficient data generation means and the plurality of first information data selected in the first data selection means.

Further, a method for processing an information signal in accordance with the present invention for converting a first information signal including a plurality of information data into a second information signal including a plurality of information data comprises a first step of inputting conversion information about a format or size conversion, a second step of converting the conversion information input in the first step into position information about a target position in the second image signal, a third step of generating coefficient data to be used in estimated equation corresponding to the position information about the target position obtained as a result of the conversion in the second step according to production equation for producing coefficient data to be used in the estimated equation using coefficient seed data and the position information about the target position, the production equation using the position information as a parameter, and the coefficient seed data being coefficient data in the production equation, a fourth step of selecting a plurality of first information data located in periphery of the target position in the second information signal based on the first information signal, and a fifth step of calculating and obtaining information data of the target position based on the estimated equation using the coefficient data generated in the third step and the plurality of first information data selected in the fourth step.

Further, an information-providing medium in accordance with the present invention provides a computer program for executing each step in the method for processing the information signal described above.

Further, an image signal processor in accordance with the present invention for converting a first image signal including a plurality of pixel data into a second image signal including a plurality of pixel data, comprises conversion information input means for inputting conversion information about a format or size conversion, information conversion means for converting the conversion information input by the conversion information input means into position information about a target position in the second image signal, memory means for storing coefficient seed data, the coefficient seed data being coefficient data in production equation for producing coefficient data to be used in estimated equation, the production equation using the position information as a parameter, coefficient data generation means for generating the coefficient data to be used in the estimated equation corresponding to the position information about the target position, the coefficient data in the estimated equation being produced according to the production equation using the coefficient seed data stored in the memory means and the position information about the target position obtained as a result of conversion in the information conversion means, data selection means for selecting a plurality of pixel data located in periphery of the target position in the second image signal, based on the first image signal, and calculation means for calculating and obtaining pixel data of the target position based on the estimated equation using the coefficient data generated in the coefficient data generation means and the plurality of pixel data selected in the data selection means.

Further, an image display apparatus according to the present invention comprises image signal input means for inputting a first image signal including a plurality of pixel data, image signal processing means for converting the first image signal input from the image signal input means into a second image signal including a plurality of pixel data and for outputting the resultant second image signal, image display means for displaying an image produced by the second image signal received from the image signal processing means onto an image display element, and conversion information input means for inputting conversion information corresponding to a format or a size of the image displayed on the image display element. The image signal processing means includes information conversion means for converting the conversion information input by the conversion information input means into position information about a target position in the second image signal, first memory means for storing coefficient seed data, the coefficient seed data being coefficient data in production equation for producing coefficient data to be used in estimated equation, and the production equation using the position information as a parameter, coefficient data generation means for generating coefficient data to be used in the estimated equation corresponding to the position information about the target position, the coefficient data in the estimated equation being produced according to the production equation using the coefficient seed data stored in the first memory means and the position information about the target position obtained as a result of conversion in the information conversion means, first data selection means for selecting a plurality of first pixel data located in periphery of the target position in the second image signal, based on the first image signal, and calculation means for calculating and obtaining pixel data of the target position based on the estimated equation using the coefficient data generated in the coefficient data generation means and the plurality of first pixel data selected in the first data selection means.

According to the present invention, the conversion information about the format or size conversion is input and this conversion information is converted into the position information about the target position in the second information signal. Herein, the information signal is a signal such as an image signal and a sound signal. When the information signal is the image signal, the format or the image size after the conversion makes the position relationship of the pixels of the output image signal to the pixels of the input image signal uniquely determined. In addition, the plurality of first information data located in periphery of the target position in the second information signal is selected according to the first information signal.

Then, the information data of the target position is obtained corresponding to the position information about the target position in the second information signal. Specifically, the memory means stores the coefficient seed data, which is coefficient data in the production equation for producing the coefficient data to be used in the estimated equation. By use of this coefficient seed data and the position information about the target position in the second information signal, coefficient data in the estimated equation corresponding to the position information about this target position is generated. Then, by use of thus-generated coefficient data and the plurality of the first information data, information data of the target position is produced based on the estimated equation.

According to the invention described above, when the first information signal is to be converted into the second information signal, the position information about the target position in the second information signal is obtained from the conversion information about the format or size conversion, the coefficient data in the estimated equation is produced from the coefficient seed data based on thus-obtained position information, and the information data of the target position in the second information signal is obtained using the coefficient data. Therefore, the memory stores no coefficient data corresponding to various formats and sizes so that there is no need of a memory for storing a large amount of coefficient data on the conversions into various formats or sizes are performed.

When a sum of the coefficient data of the estimated equation produced using the coefficient seed data is obtained and then the information data of the target position produced using the estimated equation as described above is normalized with it being divided by the sum, it becomes possible to remove the fluctuations in the levels from the information data of the target position caused by a rounding error which occurs at the time when the coefficient data of the estimated equation is obtained by the production equation using the coefficient seed data.

Further, a coefficient seed data production device in accordance with the present invention for producing coefficient seed data, the coefficient seed data being coefficient data in a production equation for producing coefficient data to be used in estimated equation employed when converting a first information signal including a plurality of information data into a second information signal including a plurality of information data, the production equation using position information as a parameter, comprises signal processing means for performing a thinning-out processing on a teacher signal to obtain a student signal, position shift means for shifting a position of the student signal with a position of information data position of the teacher signal being gradually changed with respect to the information data position of the student signal, first data selection means for selecting a plurality of first information data located in periphery of a target position in the teacher signal, based on the student signal having a position shifted by the position shift means, normal equation production means for producing a normal equation for obtaining the coefficient seed data using the plurality of the first information data selected by the first data selection means and the information data at the target position in the teacher signal, and coefficient seed data calculation means for solving the normal equation to obtain the coefficient seed data.

Further, a method for producing coefficient seed data in accordance with the present invention for producing coefficient seed data used for producing coefficient data to be used in an estimated equation employed when converting a first information signal including a plurality of information data into a second information signal including a plurality of information data, the coefficient seed data being coefficient data in a production equation using position information as a parameter, comprises a first step of performing a thinning-out processing on a teacher signal to obtain a student signal, a second step of shifting a position of the student signal with the position of information data position of the teacher signal being gradually changed with respect to the information data position of the student signal, a third step of selecting a plurality of information data located in periphery of a target position in the teacher signal, based on the student signal having a position shifted in the second step, a fourth step of producing a normal equation for obtaining the coefficient seed data using the plurality of the information data selected in the third step and the information data at the target position in the teacher signal, and a fifth step of solving the normal equation produced in the fourth step to obtain the coefficient seed data.

Further, an information-providing medium in accordance with the present invention provides a computer program for executing each step in the method for producing the coefficient seed data described above.

According to the present invention, the thinning-out processing is performed on the teacher signal to obtain the student signal. When the 1050 i signal is illustratively used as the teacher signal, the thinning-out processing is performed on the 1050 i signal to obtain 525 i signal as the student signal. Then, the position of the student signal is shifted with a position of the information data position of the teacher signal being gradually changes with respect to the information data position of the student signal.

A plurality of information data located in periphery of the target position in the teacher signal is selected on the basis of the position-shifted student signal. Then, by use of thus-selected plurality of information data and the information data of the target position in the teacher signal, a normal equation for obtaining the coefficient seed data is produced. This equation is then solved to obtain the coefficient seed data.

Herein, the coefficient seed data is coefficient data in the production equation for producing coefficient data to be used in the estimated equation employed when converting the first information signal into the second information signal, the production equation using the position information as a parameter. Using this coefficient seed data allows the coefficient data corresponding to arbitrary position information to be obtained according to the production equation. As a result of this, when converting the format or the size, the coefficient data of the estimated equation is produced from the coefficient seed data on the basis of the position information about the target position in the second information signal so that it can obtain the information data of the target position using thus-produced coefficient data.

Further, a coefficient seed data production device in accordance with the present invention for producing coefficient seed data, the coefficient seed data being coefficient data in production equation for producing coefficient data to be used in estimated equation employed when converting a first information signal including a plurality of information data into a second information signal including a plurality of information data, and the production equation using position information as a parameter, comprises signal processing means for performing a thinning-out processing on a teacher signal to obtain a student signal, position shift means for shifting a position of the student signal with a position of information data position of the teacher signal being gradually changed with respect to the information data position of the student signal, first data selection means for selecting a plurality of first information data located in periphery of a target position in the teacher signal, based on the student signal having a position shifted by the position shift means, first normal equation production means for producing a first normal equation for obtaining the coefficient data of the estimated equation per position shift value of the student signal using the plurality of the first information data selected in the first data selection means and the information data at the target position in the teacher signal, coefficient data calculation means for solving the first normal equation to obtain the coefficient data of the estimated equation per the position shift value, second normal equation production means for producing a second normal equation for obtaining the coefficient seed data using the coefficient data per the position shift value obtained in the coefficient data calculation means, and coefficient seed data calculation means for solving the second normal equation to obtain the coefficient seed data.

Further, a method for producing coefficient seed data in accordance with the present invention for producing coefficient seed data, the coefficient seed data being coefficient data in production equation for producing coefficient data to be used in estimated equation employed when converting a first information signal including a plurality of information data into a second information signal including a plurality of information data, and the production equation using the position information as a parameter, comprises a first step of performing a thinning-out processing on a teacher signal to obtain a student signal, a second step of shifting a position of the student signal with a position of information data position of the teacher signal being gradually changed with respect to the information data position of the student signal, a third step of selecting a plurality of information data located in periphery of a target position in the teacher signal, based on the student signal having a position shifted in the second step, a fourth step of producing a first normal equation for obtaining the coefficient data of the estimated equation per position shift value of the student signal using the plurality of the information data selected in the third step and the information data at the target position in the teacher signal, a fifth step of solving the first normal equation produced in the fourth step to obtain the coefficient data of the estimated equation per the position shift value, a sixth step of producing a second normal equation for obtaining the coefficient seed data using the coefficient data per the position shift value obtained in the fifth step, and a seventh step of solving the second normal equation produced in the sixth step to obtain the coefficient seed data.

Further, an information-providing medium in accordance with the present invention provides a computer program for executing each step in the method for producing the coefficient seed data described above.

According to the present invention, the thinning-out processing is performed on the teacher signal to obtain the student signal. When the 1050 i signal is illustratively used as the teacher signal, the thinning-out processing is performed on the 1050 i signal to obtain 525 i signal as the student signal. Then, the position of the student signal is shifted with the position of the information data position of the teacher signal being gradually changes with respect to the information data position of the student signal.

A plurality of information data located in periphery of the target position in the teacher signal is selected on the basis of the position-shifted student signal. Then, by use of thus-selected plurality of information data and the information data of the target position in the teacher signal, a first normal equation for obtaining the coefficient data of the estimated equation is produced at every position shift value of the student signal. This equation is then solved to obtain coefficient data of the estimated equation at every position shift value.

Further, by use of the coefficient data at every position shift value, a second normal equation for obtaining coefficient seed data is produced. This equation is then solved so as to obtain coefficient seed data.

Herein, the coefficient seed data is coefficient data in the production equation for producing the coefficient data to be used in the estimated equation employed when converting the first information signal into the second information signal, the production equation using the position information as parameter. Using this coefficient seed data allows the coefficient data corresponding to arbitrary position information to be obtained according to the production equation. As a result of this, at the time of the format or size conversion, the coefficient data of the estimated equation is produced according to the coefficient seed data based on the position information about the target position in the second information signal. Then, by use of thus-produced coefficient data, it becomes possible to obtain the information data of the target position.

BRIEF DESCRIPTION OF THE DRAWINGS

FIG. 1 is a block diagram showing a configuration of television receiver as an embodiment;

FIG. 2 is a diagram showing an example of a concept of a method for producing coefficient seed data;

FIG. 3 is a diagram showing a positional relationship between the pixels of the 525 i signal (the SD signal) and the pixels of the 1050 i signal (the HD signal);

FIG. 4 is a diagram for illustrating a position shift in eight stages in a vertical direction;

FIG. 5 is a diagram for illustrating a position shift in four stages in a horizontal direction;

FIG. 6 is a diagram showing a position relationship between the SD signal (the 525 i signal) and the HD signal (the 1050 i signal);

FIG. 7 is a block diagram showing an exemplary structure of a coefficient seed data production device;

FIG. 8 is a diagram of another example of a concept of a method for producing coefficient seed data;

FIG. 9 is a block diagram showing another exemplary structure of a coefficient seed data production device;

FIG. 10 is a block diagram showing an exemplary structure of an image signal processor to be implemented in software;

FIG. 11 is a flow chart showing a procedure of processing an image signal;

FIG. 12 is a flow chart showing a processing of producing coefficient seed data (No. 1);

FIG. 13 is a flow chart showing a processing of producing coefficient seed data (No. 2);

FIG. 14 is a diagram showing a positional relationship between the pixels of the 525 i signal and the pixels of the 1080 i signal;

FIG. 15 is a diagram showing a position relationship in a vertical direction between the pixels of the 525 i signal and the pixels of the 1080 i signal;

FIG. 16 is a diagram showing a position relationship in a horizontal direction between the pixels of the 525 i signal and the pixels of the 1080 i signal;

FIG. 17 is a diagram showing a positional relationship between the pixels of the 525 i signal and the pixels of the XGA signal;

FIG. 18 is a diagram showing a position relationship in a vertical direction between the pixels of the 525 i signal and the pixels of the XGA signal; and (per Q. Spec.)

FIG. 19 is a diagram showing a position relationship in a horizontal direction between the pixels of the 525 i signal and the pixels of the XGA signal.

BEST MODE FOR CARRYING OUT THE INVENTION

Hereinafter, embodiments of the present invention will be described with reference to drawings. FIG. 1 shows a configuration of television receiver 100 as an embodiment. The television receiver 100 receives a 525 i signal from a broadcast signal and converts the 525 i signal into a 1080 i signal or a XGA signal so as to display an image, or converts the 525 i signal into a new 525 i signal for partially magnifying the image by an arbitrary magnification and displaying the partially magnified image.

The television receiver 100 comprises a system controller 101 with a microcomputer for controlling operations of the entire system, and a remote control signal receiving circuit 102 for receiving a remote control signal. The remote control signal receiving circuit 102 is connected to the system controller 101, and it is constituted so as to receive a remote control signal RM from a remote control transmitter 200 in accordance with the user operation and to supply an operation signal corresponding to the received signal RM to the system controller 101.

The television receiver 100 also comprises a receiving antenna 105, a tuner 106 for receiving a broadcast signal (RF modification signal) captured by the receiving antenna 105, and performing processing such as a channel selection, a middle frequency amplification, and a wave detection so as to obtain a 525 i signal, and a buffer memory 109 for temporarily storing the 525 i signal output from the tuner 106.

The television receiver 100 further comprises an image signal processing section 110 for using the 525 i signal temporarily stored in the buffer memory 109 as an input image signal Vin and converting the 525 i signal into a 1080 i signal or a XGA signal, or converting it into a new 525 i signal for partially magnifying the image by an arbitrary magnification and displaying the partially magnified image, and then transmitting the resultant signal, and a display section 111 for displaying an image produced by the output image signal Vout received from the image signal processing section 110. The display section 111 is constituted by, for example, a display apparatus such as a cathode-ray tube (CRT) display, a liquid crystal display (LCD).

An operation of the television receiver 100 shown in FIG. 1 will be described.

The 525 i signal transmitted from the tuner 106 is supplied to the buffer memory 109, which temporarily stores it. The 525 i signal stored in the buffer memory 109 is supplied to the image signal processing section 110 as an input image signal Vin.

In the image signal processing section 110, in response to the setting by the user through operations of the remote control transmitter 200, the 525 i signal as the input image signal Vin is converted into a 1080 i signal or a XGA signal, or the 525 i signal is converted into a new 525 i signal for partially magnifying the image by an arbitrary magnification and displaying the partially magnified image. The output image signal Vout transmitted from the image signal processing section 110 is supplied to the display section 111, which displays an image produced by the output image signal Vout on the screen thereof.

Next, details of the image signal processing section 110 will be described. The image signal processing section 110 includes first to third tap selection circuits 121 to 123 each for selectively extracting a plurality of pixel data located in periphery of each pixel (target pixel) within a unit pixel block constituting the output image signal Vout from the 525 i signal stored in the buffer memory 109, and then transmitting them.

The first tap selection circuit 121 selectively extracts data of the pixel for use in prediction (hereinafter, referred to as “prediction tap”). The second tap selection circuit 122 selectively extracts data of the pixel for use in sorting space classes (hereinafter, referred to as “space class tap”). The third tap selection circuit 123 selectively extracts data of pixel for use in sorting movement classes (hereinafter, referred to as “movement class tap”). Where the space class is determined using the pixel data belonging to the plural fields, this space class also contains information about movements.

The image signal processing section 110 also includes a space class detection circuit 124 for detecting a distribution pattern of levels of data of space class tap (two or more) selectively extracted in the second tap selection circuit 122, and detecting a space class based on the distribution pattern of the levels so as to transmit information about the class.

The space class detection circuit 124 performs an operation such that, for example, the space class tap data is compressed from 8 bit-data into 2 bit-data. Then, the space class detection circuit 124 transmits the compressed data each corresponding to the space class tap data as class information of the space class. In this embodiment, data compression is performed according to an adaptive dynamic range coding (ADRC) method. Alternative to ADRC, as a method for compressing information, also employable is prediction coding such as differential pulse code modulation (DPCM), vector quantization (VQ) and the like.

Originally, ADRC is an adaptive re-quantization method, which has been developed for use in high performance coding for video tape recorder (VTR). The ADRC is also preferable to a case used in the data compression described above because this method is capable of effectively expressing a local pattern of a signal level in a short language. In the case of employing ADRC, defining the maximum value of the space class tap data as MAX, the minimum value thereof as MIN, a dynamic range of the space class tap data as DR (=MAX−MIN+1), and re-quantized bit number as P, a re-quantized code qi as compressed data is obtained from an operation in following Equation (1) as to each space class tap data ki. qi=[(ki−MIN+0.5)0.2^(P) /DR]  (1)

In the Equation (1), the portion enclosed with [ ] means truncation process. When there is pixel data in the number of Na as the space class tap data, i is set to 1 to Na.

The image signal processing section 110 also includes an movement class detection circuit 125 for detecting a movement class for mainly expressing the degree of movement, from the movement class tap data (two or more) selectively extracted in the third tap selection circuit 123, and then transmitting the class information thereof.

In the movement class detection circuit 125, a differential between frames is calculated from the movement class tap data selectively extracted in the third tap selection circuit 123. Then, a threshold value processing is performed on an average value of the absolute values of differentials so that the movement class, which is an index of movement, can be detected. Specifically, in the movement class detection circuit 125, an average value AV of the absolute values of the differentials is calculated in following Equation (2).

$\begin{matrix} {{AV} = \frac{\sum\limits_{i = 1}^{Nb}{{{mi} - {ni}}}}{Nb}} & (2) \end{matrix}$

When six pixel data m1 to m6 and six pixel data n1 to n6 located in the immediately preceding frame are extracted as class tap data, for example, in the third tap selection circuit 123, Nb in the Equation (2) is 6.

In the movement class detection circuit 125, the average value AV calculated as described above is compared with one or a plurality of threshold values so as to allow class information MV about movement class to be obtained. For example, when three threshold values th1, th2, th3 (th1<th2<th3) are prepared and four movement classes are to be detected, MV is set to 0 when AV≦th1; MV is set to 1 when th1<AV≦th2; MV is set to 2 when th2<AV≦th3; and MV is set to 3 when th3<AV.

The image signal processing section 110 also includes a class synthesis circuit 126 for obtaining a class code CL showing a class including the data of each pixel (target pixel) within the unit pixel block constituting the output image signal Vout to be produced, based on the re-quantized code qi as class information about the space class received from the space class detection circuit 124 and the class information MV about the movement class received from the movement class detection circuit 125.

In the class synthesis circuit 126, the class code CL is calculated in following Equation (3).

$\begin{matrix} {{CL} = {{\sum\limits_{i\mspace{14mu} 1}^{Na}{{qi}\left( 2^{P} \right)}^{i\mspace{14mu} 1}} + {{MV} \cdot \left( 2^{P} \right)^{Na}}}} & (3) \end{matrix}$

In the Equation (3), Na indicates the number of space class tap data, and P indicates the re-quantized bit number in ADRC method.

The image signal processing section 110 also includes registers 130 to 133 and a coefficient memory 134. A post-processing circuit 129, which will be described later, is required to change its operation among the case where a 1080 i signal is transmitted as the output image signal Vout, the case where an XGA signal is transmitted as the output image signal Vout, and the case where a 525 i signal is transmitted as the output image signal Vout. The register 130 stores operation specifying information for specifying operations of the post-processing circuit 129. The post-processing circuit 129 exhibits the operations in compliance with the operation specifying information supplied from the register 130.

The register 131 stores information about the tap position of the prediction tap to be selected in the first tap selection circuit 121. The first tap selection circuit 121 selects the prediction tap in compliance with the tap position information supplied from the register 131. The tap position information assigns numbers to the plurality of pixels which may be selected for example, and specifies the number of pixel to be selected. The tap position information described hereinafter also performs the same operation as described above.

The register 132 stores tap position information of the space class tap to be selected in the second tap selection circuit 122. The second tap selection circuit 122 selects the space class tap in compliance with the tap position information supplied from the register 132.

Therein, the register 132 stores tap position information A of the case where a movement is relatively small, and tap position information B of the case where a movement is relatively large. Which of the tap position information A or B is to be supplied to the second tap selection circuit 122 is determined by the class information MV of the movement class transmitted from the movement class detection circuit 125.

Specifically, if MV is 0 or MV is 1 because there is no movement or the movement is small, the tap position information A is supplied to the second tap selection circuit 122. The space class tap selected in the second tap selection circuit 122 is made to extend over plural fields. Contrarily, if MV is 2 or MV is 3 because the movement is relatively large, the tap position information B is supplied to the second tap selection circuit 122. Although not shown in the drawings, the space class tap selected in the second tap selection circuit 122 is made to be only the pixel within the field where the pixel to be produced is present.

Alternatively, it is also possible that the register 131 described above also stores the tap position information of the case where the movement is relatively small and the tap position information of the case where the movement is relatively large, so that the tap position information to be supplied to the first tap selection circuit 121 can be selected by the class information MV of the movement class transmitted from the movement class detection circuit 125.

The register 133 stores the tap position information of the movement class tap to be selected in the third tap selection circuit 123. The third tap selection circuit 123 selects a movement class tap in compliance with the tap position information supplied from the register 133.

The coefficient memory 134 stores, for each class, the coefficient data of the estimated equation to be used in an estimated prediction calculation circuit 127, which will be described later. The coefficient data is information for converting the 525 i signal into the 1080 i signal or the XGA signal, or for converting the 525 i signal into a new 525 i signal for partially magnifying the image by an arbitrary magnification and displaying the partially magnified image. The coefficient memory 134 receives the class code CL from the class synthesis circuit 126 described above as read address information. Coefficient data corresponding to the class code CL is read out of the coefficient memory 134, and thus read coefficient data is supplied to the estimated prediction calculation circuit 127.

The image signal processing section 110 also includes an information memory bank 135. In the information memory bank 135, movement specifying information to be stored into the register 130 and the tap position information to be stored in the registers 131 to 133 are stored beforehand.

Herein, as the movement specifying information to be stored in the register 130, first movement specifying information for operating the post-processing circuit 129 to transmit the 1080 i signal, second movement specifying information for operating the post-processing circuit 129 to transmit the XGA signal, and third movement specifying information for operating the post-processing circuit 129 to transmit the 525 i signal, are stored beforehand in the information memory bank 135.

The user can make selection among the first conversion method for transmitting the 1080 i signal, the second conversion method for transmitting the XGA signal, or the third conversion method for transmitting the 525 i signal, by operating the remote control transmitter 200. In the case of selecting the third conversion method, the user can further specify the magnification (the image size) of the image to be displayed. The information memory bank 135 receives the selection information about the conversion method to be selected from the system controller 101. The information memory bank 135 loads the first, second, or third movement specifying information in compliance with the received selection information into the register 130.

In the information memory bank 135, first tap position information corresponding to the first conversion method (1080 i), second tap position information corresponding to the second conversion method (XGA), and third tap position information corresponding to the third conversion method (525 i), are stored beforehand as the tap position information of the prediction tap to be stored in the register 131. The information memory bank 135 loads the first, second, or third tap position information into the register 131 in compliance with the selection information about the conversion method described above.

It is also possible that tap position information corresponding to the magnification of the image to be displayed is stored into the information memory bank 135 beforehand as the third tap position information corresponding to the third conversion method, and at the same time when the third conversion method is selected, the tap position information corresponding to the specified magnification is loaded from the information memory bank 135 into the register 131. The same thing is applicable to the case where the tap information is loaded into registers 132 and 133, which will be described later.

Further, the first tap position information corresponding to the first conversion method (1080 i), the second tap position information corresponding to the second conversion information (XGA), and the third tap position information corresponding to the third conversion method (525 i) are stored beforehand in the information memory bank 135 as tap position information of the space class tap to be stored into the register 132. The first, second, and third tap position information is respectively constituted by tap position information for the case where a movement is relatively small, and tap position information for the case where a movement is relatively large. The first, second, or third tap position information is loaded from the information memory bank 135 into the register 132 in compliance with the selection information about the conversion method described above.

Further, the first tap position information corresponding to the first conversion method (1080 i), the second tap position information corresponding to the second conversion method (XGA), and the third tap position information corresponding to the third conversion method (525 i) are stored beforehand in the-information memory bank 135 as tap position information of the movement class tap to be stored in the register 133. The first, second, or third tap position information is loaded from the information memory bank 135 into the register 133 in compliance with the selection information about the conversion method described above.

Further, the information memory bank 135 stores coefficient seed data of each class beforehand. The coefficient seed data is coefficient data of the production equation for producing coefficient data to be stored into the coefficient memory 134 described above, the production equation using the position information as a parameter.

In the estimated prediction calculation circuit 127, which will be described later, pixel data y to be produced is calculated according to the estimated equation of Equation (4) from prediction tap data xi and the coefficient data Wi read out of the coefficient memory 134.

$\begin{matrix} {y = {\sum\limits_{i = 1}^{n}{{Wi} \cdot {xi}}}} & (4) \end{matrix}$

When ten prediction taps are selected in the first tap selection circuit 121, n in the Equation (4) is 10.

Then, the coefficient data Wi (i=1 to n) of this estimated equation is produced according to the production equation using the position information h, v as the parameter, as shown in following Equation (5) for example. W ₁ =w ₁₀ +w ₁₁ v+w ₁₂ h+w ₁₃ v ² +w ₁₄ vh+w ₁₅ h ² +w ₁₆ v ³ +w ₁₇ v ² h+w ₁₈ vh ² +w ₁₉ h ³ W ₂ =w ₂₀ +w ₂₁ v+w ₂₂ h+w ₂₃ v ² +w ₂₄ vh+w ₂₅ h ² +w ₂₆ v ³ +w ²⁷ v ² h+w ₂₈ vh ² +w ₂₉ h ³ W _(i) =w _(i0) +w _(i1) v+w _(i2) h+w _(i3) v ² +w _(i4) vh+w _(i5) h ² +w _(i6) v ³ +w _(i7) v ² h+w _(i8) vh ² +w _(i9) h ³ W _(n) =w _(n0) +w _(n1) v+w _(n2) h+w _(n3) v ² +w _(n4) vh+w _(n5) h ² +w _(n6) v ³ +w _(n7) v ² h+w _(n8) vh ² +w _(n9) h ³  (5)

In the information memory bank 135, coefficient seed data W₁₀ to W_(n9), which is coefficient data of this production equation, is stored per class. The method for producing the coefficient seed data will be described later.

The image signal processing section 110 also includes a coefficient production circuit 136 for producing, for each class, the coefficient data Wi (i=1 to n) of the estimated equation corresponding to the values of the position information h, v according to the Equation (5) using the coefficient seed data of each class and each value of the position information h, v. The coefficient seed data of each class is loaded into this coefficient production circuit 136 from the information memory bank 135. In addition, the position information h, v in the horizontal direction and the vertical direction of each pixel within the unit pixel block constituting the output image signal Vout generated in a position information generation circuit 139, which will be described later, is supplied to the coefficient production circuit 136. The coefficient data Wi (i=1 to n) each corresponding to the position information h, v of each class produced in the coefficient production circuit 136 is stored in the coefficient memory 134 described above.

The image signal processing section 110 also includes a position information generation circuit 139 for generating the position information h, v in the horizontal direction and the vertical direction of each pixel within the unit pixel block constituting the output image signal Vout, based on the selection information about the conversion method and the corresponding function information n/m relating to the number of pixels in each field in the vertical direction and in the horizontal direction in the input image signal Vin and the output image signal Vout corresponding to the information for specifying the magnification, which are received from the system controller 101. This position information generation circuit 139 is constituted by a ROM table, for example.

The position information h, v in the horizontal direction and the vertical direction of each pixel generated in the position information generation circuit 139 is respectively associated with the pixel number (tap number) and then supplied to the coefficient production circuit 136. The position information generation circuit 139 generates the position information h, v corresponding to the respective odd and even fields of the input image signal Vin.

For example, when the first conversion method (1080 i) is selected, n/m is 9/4 as to the vertical direction, and n/m is 9/4 as to the horizontal direction (see FIG. 14). As a result, the 9×9 pixel block of the 1080 i signal as the output image signal Vout corresponds to the 4×4 pixel block of the 525 i signal as the input image signal Vin. In this case, the unit pixel block constituting the output image signal Vout is a 9×9 pixel block.

In this case, in the position information generation circuit 139, as to each pixel within this 9×9 unit pixel block, a distance between pixels located at positions closest to each other in the vertical direction (pixels at a shortest distance) is obtained among the pixels within the 4×4 pixel block of the 525 i signal described above, and the obtained value of the distance is used as position information v; and a distance between pixels located at positions closest to each other in the horizontal direction (pixels at a shortest distance) is obtained, and the obtained value of the distance is used as position information h. In this embodiment, the position information h, v described above is obtained under the condition where the interval between pixels in the vertical direction of the 525 i signal is set to 16,and the interval between pixels in the horizontal direction thereof is set to 8. The same thing is applied to the case where the second and third conversion methods are selected respectively.

Herein, the position information v is set to a negative value when the target pixel within the 9×9 unit pixel block is located at a position upper than the pixel at the shortest distance. Contrarily, the position information v is set to a positive value when the target pixel within the 9×9 unit pixel block is located at a position lower than the pixel at the shortest distance described above. In addition, the position information h is set to a negative value when the target pixel thereof is located at a position left of the pixel at the shortest distance. Contrarily, the position information h is set to a positive value when the target pixel thereof is located at a position right of the pixel at the shortest distance. The same thing is applied to the case where the second and third conversion methods are selected, respectively.

As described above, when the first conversion method (1080 i) is selected, in the position information generation circuit 139, the position information h, v is generated for each of 81 pixels, which constitute the 9×9 unit pixel block, in correspondence with the respective odd and even fields.

In addition, when the second conversion method (XGA) is selected for example, n/m is 16/5 as to the vertical direction, and n/m is 8/5 as to the horizontal direction (see FIG. 17). As a result, the 8×16 pixel block of the XGA signal as the output image signal Vout corresponds to the 5×5 pixel block of the 525 i signal as the input image signal Vin. In this case, the unit pixel block constituting the output image signal Vout is a 8×16 pixel block.

In this case, in the position information generation circuit 139, as to each pixel within this 8×16 unit pixel block, a distance between pixels located at positions closest to each other in the vertical direction (pixels at a shortest distance) is obtained among the pixels within the 5×5 pixel block of the 525 i signal described above, and the obtained value of the distance is used as position information v; and a distance between pixels located at positions closest to each other in the horizontal direction (pixels at a shortest distance) is obtained, and the obtained value of the distance is used as position information h.

As described above, when the second conversion method (XGA) is selected, in the position information generation circuit 139, the position information h, v is generated for each of 128 pixels, which constitute the 8×16 unit pixel block, in correspondence with the respective odd and even fields.

In addition, when the third conversion method (525 i) is selected for example, the values of n/m in the vertical direction and in the horizontal direction are uniquely determined in correspondence with the specified magnification of the image to be displayed (the image size). Assuming that n/m is nv/mv as to the vertical direction and n/m is nh/mh as to the horizontal direction, nh×nv pixel block of the 525 i signal as the output image signal Vout corresponds to the mh×mv pixel block of the 525 i signal as the input image signal Vin. In this case, the unit pixel block constituting the output image signal Vout is a nh×nv pixel block.

In this case, in the position information generation circuit 139, as to each pixel within this nh×nv unit pixel block, a distance between pixels located at positions closest to each other in the vertical direction (pixels at a shortest distance) is obtained among the pixels within the nh×mv pixel block of the 525 i signal as the input image signal Vin described above, and the obtained value of the distance is used as position information v; and a distance between pixels located at positions closest to each other in the horizontal direction (pixels at a shortest distance) is obtained, and the obtained value of the distance is used as position information h.

As described above, when the third conversion method (525 i) is selected, in the position information generation circuit 139, the position information h, v is generated for each of the pixels, which constitute the nh×nv unit pixel block, in correspondence with the respective odd and even fields.

The image signal processing section 110 also includes a normalized coefficient production circuit 137 for calculating according to following Equation (6) a normalized coefficient S corresponding to the coefficient data Wi (i=1 to n) of the respective position information h, v of each class produced by the coefficient production circuit 136, and a normalized coefficient memory 138 for storing thus-produced normalized coefficient S per class. The normalized coefficient memory 138 receives the class code CL from the aforementioned class synthesis circuit 126 as read address information. The normalized coefficient S corresponding to the class code CL is read out of the normalized coefficient memory 138, and then thus read normalized coefficient S is supplied to a normalized calculation circuit 128, which will be described later.

$\begin{matrix} {S = {\sum\limits_{i = 1}^{n}{Wi}}} & (6) \end{matrix}$

The image signal processing section 110 also includes the estimated prediction calculation circuit 127 for calculating data of each pixel within the unit pixel block constituting the output image signal Vout, based on the prediction tap data xi selectively extracted in the first tap selection circuit 121 and the coefficient data Wi read out of the coefficient memory 134.

In this estimated prediction calculation circuit 127, pixel data constituting the output image signal Vout is produced for every unit pixel block. Specifically, the estimated prediction calculation circuit 127 receives the prediction tap data xi corresponding to each pixel within the unit pixel block (target pixel) from the first tap selection circuit 121 and the coefficient data Wi corresponding to each pixel constituting the unit pixel block from the coefficient memory 134. The data of each pixel constituting the unit pixel block is calculated separately according to the estimated equation of the aforementioned Equation (4).

For example, in the estimated prediction calculation circuit 127, when the first conversion method (1080 i) is selected, data of 81 pixels constituting the unit pixel block is simultaneously produced; when the second conversion method (XGA) is selected, data of 128 pixels constituting the unit pixel block is simultaneously produced; and when the third conversion method (525 i) is selected, data of pixels in the number of (nh×nv) constituting the unit pixel block (the values of nh and nv change in accordance with the specified magnification of the image to be displayed) is simultaneously produced.

The image signal processing section 110 also includes a normalized calculation circuit 128 for normalizing with dividing the data y₁ to y_(p) (P shows the number of pixels constituting the unit block) of each pixel within the unit pixel block constituting the output image signal Vout, each data y₁ to y_(p) being sequentially output from the estimated prediction calculation circuit 127, by the normalized coefficient S corresponding to the coefficient data Wi (i=1 to n) which is read from the normalized coefficient memory 138 and is used in the production of the respective data y₁ to y_(p). Although not described above, when the coefficient production circuit 136 produces the coefficient data of the estimated equation from the coefficient seed data according to the production equation, the produced coefficient data contains a rounding error, and there is no guarantee that the sum of the coefficient data Wi (i=1 to n) is 1.0. Therefore, the data y₁ to y_(p) of each pixel calculated in the estimated prediction calculation circuit 127 involves a level fluctuation as a result of rounding error. As described above, the fluctuation can be removed by normalizing them in the normalized calculation circuit 128.

In addition, the image signal processing section 110 also includes the post-processing circuit 129 for processing the data y₁′ to y_(p)′ of the pixels within the unit pixel block normalized in the normalized calculation circuit 128 and sequentially received therefrom, and transmitting the output image signal Vout with the format specified by any one of the first to third conversion methods. Specifically, the post-processing circuit 129 transmits the 1080 i signal when the first conversion method is selected, transmits the XGA signal when the second conversion method is selected, and transmits the 525 i signal when the third conversion method is selected. The information for specifying the operation of the post-processing circuit 129 is supplied from the register 130 as described above.

Next, an operation of the image signal processing section 110 will be described.

In the second tap selection circuit 122, space class tap data (pixel data) located in periphery of each pixel (target pixel) within the unit pixel block constituting the output image signal Vout to be produced is selectively extracted from the 525 i signal stored in the buffer memory 109 as the input image signal Vin. In this case, in the second tap selection circuit 122, the selection of tap is performed, based on the conversion method supplied from the register 132 and selected by the user, and the tap position information corresponding to the movement class detected in the movement class detection circuit 125.

Thus-obtained space class tap data is supplied to the space class detection circuit 124. In the space class detection circuit 124, each pixel data as the space class tap data is subjected to an ADRC processing so that a re-quantized code qi as class information of the space class (a class sort mainly for the purpose of expressing the waveform in a space) may be obtained (see the Equation (1)).

In addition, in the third tap selection circuit 123, movement class tap data (pixel data) located in periphery of the pixels within the unit pixel block (target pixel) constituting the output image signal Vout to be produced is selectively extracted from the 525 i signal stored in the buffer memory 109 as the input image signal Vin. In this case, in the third tap selection circuit 123, the selection of tap is performed on the basis of the tap position information selected by the user and supplied from the register 133, the tap position information corresponding to the conversion method.

Thus-obtained movement class tap data is supplied to the space class detection circuit 125. According to the movement class detection circuit 125, class information MV about a movement class (a class sort mainly for the purpose of expressing the degree of movement) is obtained from each pixel data as movement class tap data.

Thus-obtained movement information MV and the aforementioned re-quantized code qi are supplied to the class synthesis circuit 126. In the class synthesis circuit 126, a class code CL showing a class including data of each pixel within a unit pixel block (target pixel) is obtained from the movement information MV and the re-quantized code qi, as to each unit pixel block constituting the output image signal Vout to be produced (see the Equation (3)). Then, thus-obtained class code CL is supplied to the coefficient memory 134 and the normalized coefficient memory 138 as read address information.

The coefficient production circuit 136 produces coefficient data Wi (i=1 to n) of the estimated equation in each class corresponding to the position information h, v of each pixel within the unit pixel block constituting the output image signal Vout generated in the position information generation circuit 139, and then the coefficient data Wi is stored in the coefficient memory 134. In addition, the normalized coefficient production circuit 137 produces normalized coefficient S corresponding to the coefficient data Wi (i=1 to n) in each class and in each position information produced by the coefficient production circuit 136 as described above, and then the normalized coefficient S is stored in the normalized coefficient memory 138.

When the class code CL is supplied as read address information to the coefficient memory 134 as described above, the coefficient data Wi in each position information corresponding to the class code CL is read out of the coefficient memory 134 and then thus read coefficient data Wi is supplied to the estimated prediction calculation circuit 127. In addition, in the first tap selection circuit 121, prediction tap data (pixel data) located in periphery of each pixel (target pixel) within the unit pixel block constituting the output image signal Vout to be produced is selectively extracted from the 525 i signal stored in the buffer memory 109 as the input image signal Vin. In this case, in the first tap selection circuit 121, the selection of tap is performed on the basis of the tap position information corresponding to the conversion method selected by the user and supplied from the register 131. The prediction tap data xi is supplied to the estimated prediction calculation circuit 127.

In the estimated prediction calculation circuit 127, data y1 to yp of each pixel within the unit pixel block constituting the output image signal Vout to be produced is simultaneously calculated, from the prediction tap data xi and the coefficient data Wi in each position information read out of the coefficient memory 134 (see the Equation (4)). The data y1 to yp of each pixel within the unit pixel block constituting the output image signal Vout and sequentially transmitted from the estimated prediction calculation circuit 127, is supplied to the normalized calculation circuit 128.

As described above, the class code CL is supplied to the normalized coefficient memory 138 as read address information. Out of the normalized coefficient memory 138, read is the normalized coefficient S corresponding to the class code CL, that is, the normalized coefficient S corresponding to the coefficient data Wi which has been used in calculating the data y₁ to y_(p) output from the estimated prediction calculation circuit 127. Thus read normalized coefficient S is supplied to the normalized calculation circuit 128. In the normalized calculation circuit 128, the data y₁ to y_(p) transmitted from the estimated prediction calculation circuit 127 is normalized with dividing them by their respectively corresponding normalized coefficients S. This removes the level fluctuation of the data y₁ to y_(p) caused by rounding error occurred when the coefficient data of the estimated equation (see the Equation (4)) is obtained according to the production equation (see the Equation (5)) using the coefficient seed data.

The data y₁′ to y_(p)′ of each pixel within the unit pixel block, which is normalized in the normalized calculation circuit 128 and sequentially transmitted therefrom, is supplied to the post-processing circuit 129. The post-processing circuit 129 receives the data y₁′ to y_(p)′ and transmits them with a format specified by any one of the first to third conversion methods as the output image signal Vout. When the first conversion method is selected, the 1080 i signal is transmitted as the output image signal Vout. When the second conversion method is selected, the XGA signal is transmitted as the output image signal Vout. Further, when the third conversion method is selected, the 525 i signal is transmitted as the output image signal Vout.

As described above, in the coefficient production circuit 136, coefficient data Wi of the estimated equation corresponding to the values of the position information h, v is produced per class using the coefficient seed data in each class loaded from the information memory bank 135 and the values of the position information h, v generated in the position information generation circuit 139. Then, the resultant coefficient data Wi is stored into the coefficient memory 134. Then, by use of the coefficient data Wi in each position information read out of the coefficient memory 134 in correspondence with the class code CL, the data y₁ to y_(p) of each pixel within the unit pixel block constituting the output image signal Vout is calculated in the estimated prediction calculation circuit 127. Consequently, this eliminates needs of a memory for storing a large amount of coefficient data when a format conversion into the 1080 i signal or the XGA signal is performed, or a conversion into various image sizes is performed.

As described above, the coefficient seed data is stored per class in the information memory bank 135. This coefficient seed data is produced beforehand by learning.

First, an example of this production method will be described. The description will be made as to an example where coefficient seed data w₁₀ to w_(n9), which is coefficient data in the production equation of the Equation (5), should be obtained.

Herein, the terms ti (i=0 to 9) are defined as following Equation (7), for the purpose of description: t ₀=1; t ₁ =v; t ₂ =h; t ₃ =v ² ; t ₄ =vh; t ₅ =h ² ; t ₆ =v ³ ; t ₇ =v ² h; t ₈ =vh ²; and t ₉ =h ³  (7)

By use of the Equation (7) above, the Equation (5) can be rewritten into Equation (8) as follows.

$\begin{matrix} {W_{i} = {\sum\limits_{j = 0}^{9}{w_{ij}t_{i}}}} & (8) \end{matrix}$

Finally, an undefined coefficient w_(ij) is obtained by the leaning. Specifically, this is a solution method by use of a least square method where a coefficient value which minimizes a square error is defined per class using pixel data of a student signal and pixel data of a teacher signal. Defining the number of learning as m, a residual error at k-th learning data (1≦k≦m) as e_(k), and a sum of square errors as E, E is expressed in following Equation (9) by use of the Equations (4) and (5).

$\begin{matrix} \begin{matrix} {E = {\sum\limits_{k = 1}^{m}e_{k}^{2}}} \\ {= {\sum\limits_{k = 1}^{m}\left\lbrack {y_{k} - \left( {{W_{1}x_{1K}} + {W_{2}x_{2K}} + \ldots + {W_{n}x_{n\; K}}} \right)} \right\rbrack^{2}}} \\ {= {{\sum\limits_{k = 1}^{m}{\left\{ \quad \right.y_{k}}} - \left\lbrack {{\left( {{t_{0}w_{10}} + {t_{1}w_{11}} + \ldots + {t_{9}w_{19}}} \right)x_{1k}} + \ldots +} \right.}} \\ {\left( {{t_{0}w_{n0}} + {t_{1}w_{n1}} + \ldots + {t_{9}w_{n9}}} \right)x_{n\; k}\left. \quad \right\rbrack\left. \quad \right\}^{2}} \\ {= {{\sum\limits_{k = 1}^{m}{\left\{ \quad \right.y_{k}}} - \left\lbrack {{\left( {w_{10} + {w_{11}v} + \ldots + {w_{19}h^{3}}} \right)x_{1k}} + \ldots +} \right.}} \\ {{{\left( {w_{n0} + {w_{n1}v} + \ldots + {w_{n9}h^{3}}} \right)x_{n\; k}}\quad}\left. \quad \right\rbrack\left. \quad \right\}^{2}} \end{matrix} & (9) \end{matrix}$

Herein, the term x_(lk) shows k-th pixel data at a position of i-th prediction tap of the student image, and the term y_(k) shows k-th pixel data of the teacher image corresponding thereto.

In the solution method by use of the least square method, a value of w_(lj) which makes the partial differentiation of the Equation (9) into 0 is obtained. This is expressed by Equation (10) as follows.

$\begin{matrix} {\frac{\partial E}{\partial w_{ij}} = {{\sum\limits_{k = 1}^{m}{2\left( \frac{\partial e_{k}}{\partial w_{ij}} \right)e_{k}}} = {{- {\sum\limits_{k = 1}^{m}{2t_{j}x_{1k}e_{k}}}} = 0}}} & (10) \end{matrix}$

Hereinafter, defining the terms X_(lpjq) and Y_(lp) as shown in following Equations (11) and (12), the Equation (10) can be rewritten into following Equation (13) by use of matrix.

$\begin{matrix} {X_{ipjq} = {\sum\limits_{k = 1}^{m}{x_{ik}t_{p}x_{jk}t_{q}}}} & (11) \\ {Y_{ip} = {\sum\limits_{k = 1}^{m}{x_{ik}t_{p}y_{k}}}} & (12) \\ {{\begin{bmatrix} X_{1010} & X_{1011} & X_{1012} & \cdots & X_{1019} & X_{1020} & \cdots & X_{10{n9}} \\ X_{1110} & X_{1111} & X_{1112} & \cdots & X_{1119} & X_{1120} & \cdots & X_{11{n9}} \\ X_{1210} & X_{1211} & X_{1212} & \cdots & X_{1219} & X_{1220} & \cdots & X_{12{n9}} \\ \vdots & \vdots & \vdots & ⋰ & \vdots & \vdots & ⋰ & \vdots \\ X_{1910} & X_{1911} & X_{1912} & \cdots & X_{1919} & X_{1920} & \cdots & X_{19{n9}} \\ X_{2010} & X_{2011} & X_{2012} & \cdots & X_{2019} & X_{2020} & \cdots & X_{20{n9}} \\ \vdots & \vdots & \vdots & ⋰ & \vdots & \vdots & ⋰ & \vdots \\ X_{n910} & X_{n911} & X_{n912} & \cdots & X_{n919} & X_{n920} & \cdots & X_{n9n9} \end{bmatrix}\begin{bmatrix} w_{10} \\ w_{11} \\ w_{12} \\ \vdots \\ w_{19} \\ w_{20} \\ \vdots \\ w_{n9} \end{bmatrix}} = \left\lbrack \begin{matrix} Y_{10} \\ Y_{11} \\ Y_{12} \\ \vdots \\ Y_{19} \\ Y_{20} \\ \vdots \\ Y_{n9} \end{matrix} \right\rbrack} & (13) \end{matrix}$

This equation is generally referred to as a normal equation. The normal equation is solved about w_(lj) by use of a sweeping method (Gauss-Jordan elimination method) and the like so that coefficient seed data can be calculated.

FIG. 2 shows a concept of the aforementioned method for producing the coefficient seed data. An SD signal (525 i signal) as a student signal is produced from a HD signal (1050 i signal) as a teacher signal.

FIG. 3 shows a positional relationship of pixels between the 525 i signal and the 1050 i signal. Herein, large dots are pixels of the 525 i signal, and small dots are pixels of the 1050 i signal. Solid lines express the positions of pixels in odd fields, and broken lines express the positions of pixels in even fields.

The position of this SD signal is shifted into eight stages in a vertical direction, and is shifted into four stages in a horizontal direction so that 8×2=16 kinds of SD signals SD1 to SD16 can be produced. FIG. 4 shows the states of position shifts V1 to V8 into eight stages in a vertical direction. Herein, the interval between pixels of the SD signal in the vertical direction is 16, and the downward direction is set to a positive direction. In addition, the term “o” expresses an odd field, and the term “e” expresses an even field.

In the state of V1, the shift amount of the SD signal is set to 0. In this case, the pixels of the HD signal come to have positions of 4, 0, −4, and −8 with respect to the pixels of the SD signal. In the state of V2, the shift amount of the SD signal is set to 1. In this case, the pixels of the HD signal come to have positions of 7, 3, −1, and −5 with respect to the pixels of the SD signal. In the state of V3, the shift amount of the SD signal is set to 2. In this case, the pixels of the HD signal come to have phases of 6, 2, −2, and −6 with respect to the pixels of the SD signal. In the state of V4, the shift amount of the SD signal is set to 3. In this case, the pixels of the HD signal come to have positions of 5, 1, −3, and −7 with respect to the pixels of the SD signal.

In the state of V5, the shift amount of the SD signal is set to 4. In this case, the pixels of the HD signal come to have positions of 4, 0, −4, and −8 with respect to the pixels of the SD signal. In the state of V6, the shift amount of the SD signal is set to 5. In this case, the pixels of the HD signal come to have positions of 7, 3, −1, and −5 with respect to the pixels of the SD signal. In the state of V7, the shift amount of the SD signal is set to 6. In this case, the pixels of the HD signal come to have positions of 6, 2, −2, and −6 with respect to the pixels of the SD signal. In the state of V8, the shift amount of the SD signal is set to 7. In this case, the pixels of the HD signal come to have positions of 5, 1, −3, and −7 with respect to the pixels of the SD signal.

FIG. 5 shows the states of position shifts Hi to H4 into four stages in a horizontal direction. Herein, the interval between pixels of the SD signal in the horizontal direction is set to 8, and the right direction is set to a positive direction.

In the state of H1, the shift amount of the SD signal is set to 0. In this case, the pixels of the HD signal come to have positions of 0, and −4 with respect to the pixels of the SD signal. In the state of H2, the shift amount of the SD signal is set to 1. In this case, the pixels of the HD signal come to have 3, and −1 with respect to the pixels of the SD signal. In the state of H3, the shift amount of the SD signal is set to 2. In this case, the pixels of the HD signal come to have positions of 2, and −2 with respect to the pixels of the SD signal. In the state of H4, the shift amount of the SD signal is set to 3. In this case, the pixels of the HD signal come to have positions of 1, and −3 with respect to the pixels of the SD signal.

FIG. 6 shows the positions of the pixels of the HD signal in a case where the pixels of the SD signal are located at center positions, as to 32 kinds of SD signals obtained as a result of shifting the position of the SD signal into 8 stages in the vertical direction and into 4 stages in the horizontal direction as described above. In other words, the pixels of the HD signal come to have positions expressed by ● in FIG. 6 with respect to the pixels of the SD signal.

Returning back to FIG. 2, learning is performed between each of the SD signals in 32 kinds in total obtained as a result of shifting its position into 8 stages in the vertical direction and into 4 stages in the horizontal direction, and the HD signal, so that the coefficient seed data can be produced.

FIG. 7 shows a configuration of a coefficient seed data production device 150 for producing the coefficient seed data, based on the concept described above.

The coefficient seed data production device 150 includes an input terminal 151 for receiving the HD signal (1050 i signal) as a teacher signal, an SD signal production circuit 152A for performing a thinning-out processing on the HD signal in horizontal and vertical directions so as to obtain the SD signal as an input signal, and a position shift circuit 152B for shifting the position of the SD signal into 8 stages in the vertical direction and into 4 stages in the horizontal direction so as to obtain the SD signals SD1 to SD32 in 32 kinds in total. The position shift circuit 152B receives parameters H, V for specifying the values of the position shifts in the vertical direction and in the horizontal direction. The position shift circuit 152B is constituted by, for example, a filter having a characteristic of sinxlx; however, it is also possible to employ another kind of filter which enables position shift. As an example of another kind of filter, there is a method where only a desired position is extracted from an over sampling filter, or the like.

The coefficient seed data production device 150 also includes first to third tap selection circuits 153 to 155 each for selectively extracting the data of a plurality of SD pixels located in periphery of the target position in the HD signal (1050 i signal) from the SD signals SD1 to SD32 received from the position shift circuit 152B, and then transmits the extracted data.

These first to third tap selection circuits 153 to 155 are constituted so as to have the same structures as those of the first to third tap selection circuits 121 to 123 in the image signal processing section 110 described above. The taps selected in the fist to third tap selection circuits 153 to 155 are specified by the tap position information provided from a tap selection control section 156. In addition, the class information MV of the movement class output from a movement class detection circuit 158, which will be described later, is supplied to the tap selection control circuit 156. As a result of this, the tap position information to be supplied to the second tap selection circuit 154 is differed depending on whether a movement is large or small.

The coefficient seed data production apparatus 150 also includes a space class detection circuit 157 for detecting the distribution pattern of the levels of the space class tap data (SD pixel data) selectively extracted in the second tap selection circuit 154, detecting a space class based on the distribution pattern of levels, and then transmitting the class information thereof. The space class detection circuit 157 is constituted so as to have the same structure as that of the space class detection circuit 124 in the image signal processing section 110 described above. The space class detection circuit 157 transmits, as class information showing the space class, a re-quantized code qi for each SD pixel data as the space class tap data.

The coefficient seed data production apparatus 150 also includes the movement class detection circuit 158 for detecting a movement class mainly showing the degree of movement from the class tap data (SD pixel data) selectively extracted in the third tap selection circuit 155, and then transmitting the class information MV thereof. The movement class detection circuit 158 is constituted so as to have the same structure as that of the movement class detection circuit 125 in the image signal processing section 110 described above. In the movement class detection circuit 158, a differential between frames is calculated from the movement class tap data (SD pixel data) which is selectively extracted in the third tap selection circuit 155. Then, a threshold value processing is performed on an average value of the absolute values of differentials so that the movement class, which is an index of movement, can be detected.

The coefficient seed data production apparatus 150 also includes a class synthesis circuit 159 for obtaining a class code CL showing a class including the pixel data at the target position in the HD signal (1050 i signal), based on the re-quantized code qi as class information about the space class received from the space class detection circuit 157 and the class information MV about the movement class received from the movement class detection circuit 158. The class synthesis circuit 159 is also constituted so as to have the same structure as that of the class synthesis circuit 126 in the image signal processing section 110 described above.

The coefficient seed data production apparatus 150 also includes a normal equation production section 160 for producing a normal equation (see the Equation (13)) to be employed for obtaining coefficient seed data w₁₀ to w_(n9) for each class, from each HD pixel data y as pixel data at the target position obtained from the HD signal received at the input terminal 151, prediction tap data (SD pixel data) xi selectively extracted in the first tap selection circuit 153 respectively in correspondence with each HD pixel data y, and the class code CL received from the class synthesis circuit 159 respectively in correspondence with each HD pixel data y, and the parameters H, V of the position shift values in the vertical direction and in the horizontal direction.

In this case, learning data is produced in combination of one HD pixel data y and the prediction tap pixel data in the number of n corresponding to the HD pixel data y. The parameters H, V to be supplied to the position shift circuit 152B are sequentially changed so that 32 kinds of SD signals SD₁ to SD₃₂ having gradually-changed position shift values can be sequentially produced. As a result, a normal equation in which a large number of learning data are registered is produced in the normal equation production section 160. Thus, sequentially producing the SD signals SD₁ to SD₃₂ to register the learning data as described above allows the coefficient seed data for obtaining pixel data in an arbitrary position to be obtained.

Although not shown in the drawings, when disposing a delay circuit for time adjustment at a preceding stage of the first tap selection circuit 153, the timing of the SD pixel data xi supplied from the first tap selection circuit 153 to the normal equation production section 160 can be adjusted.

The coefficient seed data production apparatus 150 also includes a coefficient seed data decision section 161 for receiving data of the normal equation produced for each class in the normal equation production section 160, and solving the normal equation for each class so as to obtain the coefficient seed data w₁₀ to w_(n9) in each class, and a coefficient seed memory 162 for storing thus-obtained coefficient seed data w₁₀ to w_(n9). In the coefficient seed data decision section 161, the normal equation is solved according to a method such as sweeping so that the coefficient data w₁₀ to w_(n9) can be obtained.

An operation of the coefficient seed data production apparatus 150 shown in FIG. 7 will be described. When the input terminal 151 receives an HD signal (1050 i signal) as a teacher signal, the HD signal is subjected to the thinning-out processing in horizontal and vertical directions on the SD signal production circuit 152A so that an SD signal (525 i signal) as a student signal can be produced. Thus-produced SD signal is supplied to the position shift circuit 152B, which shifts the position of the SD signal into 8 stages in the vertical direction and into 4 stages in the horizontal direction (see FIGS. 4 and 5), so that 32 kinds of SD signals SD₁ to SD₃₂ can be sequentially produced.

In the second tap selection circuit 154, space class tap data (SD pixel data) located in periphery of the target position in the HD signal is selectively extracted from these SD signals SD₁ to SD₃₂. In the second tap selection circuit 154, the selection of tap is performed, based on the tap position information supplied from the tap selection control circuit 156, the tap position information corresponding to the movement class detected in the movement class detection circuit 158.

The resultant space class tap data (SD pixel data) is supplied to the space class detection circuit 157. In the space class detection circuit 157, each SD pixel data as the space class tap data is subjected to ADRC processing so that a re-quantized code qi as class information of the space class (a class sort mainly for the purpose of expressing the waveform in a space) can be produced (see the Equation (1)).

In addition, in the third tap selection circuit 155, movement class tap data (SD pixel data) located in periphery of the target position in the HD signal is selectively extracted from the SD signals SD1 to SD32 obtained in the position shift circuit 152B. In this case, in the third tap selection circuit 155, the selection of the tap is performed, based on the tap position information supplied from the tap selection control circuit 156.

Thus-obtained movement class tap data (SD pixel data) is supplied to the movement class detection circuit 158. In the movement class detection circuit 158, the class information MV about the movement class (a class sort mainly for the purpose of expressing the degree of movement) is obtained from each SD pixel data as movement class tap data.

Thus-obtained movement information MV and the aforementioned re-quantized code qi are supplied to the class synthesis circuit 159. In the class synthesis circuit 159, the class code CL showing a class including pixel data at the target position in the HD signal is obtained from the movement information MV and the re-quantized code qi (see the Equation (3)).

Further, in the first tap selection circuit 153, the prediction tap data (SD pixel data) located in periphery of the target position in the HD signal is selectively extracted from the SD signals SD₁ to SD₃₂ produced in the position shift circuit 152B. In this case, in the first tap selection circuit 153, the selection of tap is performed, based on the tap position information supplied from the tap selection control circuit 156.

In the normal equation production section 160, a normal equation (see the Equation (13)) to be employed for obtaining coefficient the seed data w₁₀ to w_(n9) is produced for each class, from each HD pixel data y as pixel data at the target position obtained from the HD signal received at the input terminal 151, prediction tap data (SD pixel data) xi selectively extracted in the first tap selection circuit 153 respectively in correspondence with each HD pixel data y, the class code CL received from the class synthesis circuit 159 respectively in correspondence with each HD pixel data y, and the parameters H, V of the position shift values in the vertical direction and in the horizontal direction.

Then, the normal equation is solved in the coefficient seed data decision section 161 so that the coefficient seed data w₁₀ to w_(n9) for each class can be obtained. The coefficient seed data w₁₀ to w_(n9) is stored in the coefficient seed memory 162 in which addresses are assigned for each class.

As described above, in the coefficient seed data production device 150 shown in FIG. 7, it is possible to produce the coefficient seed data w₁₀ to w_(n9) for each class stored in the information memory bank 135 of the image signal processing section 110 shown in FIG. 1.

Next, another example of a method for producing the coefficient seed data will be described. In the following example, the description will be made as to an example where coefficient seed data w₁₀ to w_(n9), which is coefficient data in the production equation of the Equation (5), should be obtained.

FIG. 8 shows a concept of this example. As is the case of the method for producing the coefficient seed data described above, the SD signal is shifted into 8 stages in the vertical direction and is shifted into 4 stages into the horizontal direction by the parameters H, V, so that 32 kinds of SD signals can be sequentially produced. Then, learning is performed between each SD signal and the HD signal so that coefficient data Wi of the estimated equation of the Equation (4) can be obtained. Then, coefficient seed data is produced using the coefficient data Wi produced in correspondence with each SD signal.

First, a method for obtaining the coefficient data of the estimated equation will be described. Herein, a description will be made as to a case where the coefficient data Wi (i=1 to n) of the estimated equation of the Equation (4) is obtained using a least square method. A consideration will be made on an observation equation of following Equation (14) as a generalized example, defining X as input data, W as a coefficient data, and Y as a predicted value.

$\begin{matrix} {{{X\; W} = Y}{{X = \begin{bmatrix} x_{11} & x_{12} & \cdots & x_{1n} \\ x_{21} & x_{22} & \cdots & x_{2n} \\ \cdots & \cdots & \cdots & \cdots \\ x_{m1} & x_{m2} & \cdots & x_{mn} \end{bmatrix}},\mspace{14mu}{W = \begin{bmatrix} W_{1} \\ W_{2} \\ \cdots \\ W_{n} \end{bmatrix}},\mspace{14mu}{Y = \begin{bmatrix} y_{1} \\ y_{2} \\ \cdots \\ y_{m} \end{bmatrix}}}} & (14) \end{matrix}$

In the Equation (14), m expresses the number of learning data, and n expresses the number of prediction taps.

A least square method is applied to the data collected by use of the observation equation of the Equation (14). Based on the observation equation of the Equation (14), a residual equation of following Equation (15) is considered.

$\begin{matrix} {{{X\; W} = {Y + E}},\mspace{20mu}{E = \begin{bmatrix} e_{1} \\ e_{2} \\ \cdots \\ e_{m} \end{bmatrix}}} & (15) \end{matrix}$

From the residual equation of the Equation (15), it is considered that the most probable value of each Wi is established when the condition that minimizes the value of e² of following Equation (16) is satisfied. That is, the condition of following Equation (17) may be considered.

$\begin{matrix} {e^{2} = {\sum\limits_{i = 1}^{m}e_{1}^{2}}} & (16) \\ {{{e_{1}\frac{\partial e_{1}}{\partial w_{i}}} + {e_{2}\frac{\partial e_{2}}{\partial w_{i}}} + \ldots + {e_{m}\frac{\partial e_{m}}{\partial w_{i}}}} = {0\mspace{34mu}\left( {{i = 1},2,\ldots\mspace{14mu},n} \right)}} & (17) \end{matrix}$

Specifically, conditions in the number of n based on the value of i of the Equation (17) are considered, and W₁, W₂, . . . W_(n) having values satisfying these conditions may be obtained. As a result, following Equation (18) can be obtained from the residual equation of the Equation (15). Further, following Equation (19) can be also obtained from the Equations (18) and (14).

$\begin{matrix} {{\frac{\partial e_{i}}{\partial w_{1}} = x_{i1}},{\frac{\partial e_{i}}{\partial w_{2}} = x_{i2}},\ldots\mspace{14mu},{\frac{\partial e_{i}}{\partial w_{n}} = {x_{i\; n}\mspace{34mu}\left( {{i = 1},2,\ldots\mspace{14mu},m} \right)}}} & (18) \\ {{{\sum\limits_{i = 1}^{m}{e_{i}x_{i1}}} = 0},{{\sum\limits_{i = 1}^{m}{e_{i}x_{i2}}} = 0},\ldots\mspace{14mu},{{\sum\limits_{i = 1}^{m}{e_{i}x_{i\; n}}} = 0}} & (19) \end{matrix}$

Then, a normal equation of following Equation (20) can be obtained from the Equations (15) and (19).

$\begin{matrix} \left\{ \begin{matrix} {{{\left( {\sum\limits_{j = 1}^{m}{x_{j1}x_{j1}}} \right)w_{1}} + {\left( {\sum\limits_{j = 1}^{m}{x_{j1}x_{j2}}} \right)w_{2}} + \ldots + {\left( {\sum\limits_{j = 1}^{m}{x_{j1}x_{j\; n}}} \right)w_{n}}} = \left( {\sum\limits_{j = 1}^{m}{x_{j1}y_{j}}} \right)} \\ {{{\left( {\sum\limits_{j = 1}^{m}{x_{j2}x_{j1}}} \right)w_{1}} + {\left( {\sum\limits_{j = 1}^{m}{x_{j2}x_{j2}}} \right)w_{2}} + \ldots + {\left( {\sum\limits_{j = 1}^{m}{x_{j2}x_{j\; n}}} \right)w_{n}}} = \left( {\sum\limits_{j = 1}^{m}{x_{j2}y_{j}}} \right)} \\ \ldots \\ {{{\left( {\sum\limits_{j = 1}^{m}{x_{j\; n}x_{j1}}} \right)w_{1}} + {\left( {\sum\limits_{j = 1}^{m}{x_{j\; n}x_{j2}}} \right)w_{2}} + \ldots + {\left( {\sum\limits_{j = 1}^{m}{x_{j\; n}x_{j\; n}}} \right)w_{n}}} = \left( {\sum\limits_{j = 1}^{m}{x_{j\; n}y_{j}}} \right)} \end{matrix} \right. & (20) \end{matrix}$

Since the normal equation of the Equation (20) is capable of making equations in the same number as the unknown number n, the most probable value of each Wi can be obtained. In this case, simultaneous equations are solved by a method such as sweeping.

Next, a method for obtaining the coefficient seed data using the coefficient data produced in correspondence with each SD signal will be described.

It is assumed that coefficient data in a certain class, obtained as a result of learning performed by use of the SD signal corresponding to the parameters H, V, is resulted into k_(vhi). Herein, the term i expresses the prediction tap number. Coefficient seed data of this class is obtained from the k_(vhi).

Each coefficient data Wi (i=1 to n) is expressed in the Equation (5) described above using the coefficient seed data w₁₀ to w_(n9). Herein, under the consideration that a least square method is employed for the coefficient data Wi, a residual is expressed by following Equation (21).

$\begin{matrix} \begin{matrix} {e_{vhi} = {k_{vhi} - \left( {w_{i0} + {w_{i1}v} + {w_{i2}h} + {w_{i3}v^{2}} + {w_{i4}v\; h} + {w_{i5}h^{2}} +}\quad \right.}} \\ {{w_{i6}v^{3}} + {w_{i7}v^{2}h} + {w_{i8}v\; h^{2}} + {w_{i9}h^{3}}} \\ {= {k_{vhi} - {\sum\limits_{j = 0}^{9}{w_{ij}t_{j}}}}} \end{matrix} & (21) \end{matrix}$

Herein, the term t_(j) has been expressed in the Equation (7) described above. When a least square method is employed in the Equation (21), following Equation (22) can be obtained.

$\begin{matrix} \begin{matrix} {\frac{\partial}{\partial w_{ij}} = {{\sum\limits_{v}{\sum\limits_{h}\left( e_{vhi} \right)^{2}}} = {\sum\limits_{v}{\sum\limits_{h}{2\left( \frac{\partial e_{vhi}}{\partial w_{ij}} \right)e_{vhi}}}}}} \\ {= {- {\sum\limits_{v}{\sum\limits_{h}{2t_{j}e_{vhi}}}}}} \\ {= 0} \end{matrix} & (22) \end{matrix}$

Herein, defining the terms X_(jk), Y_(j) as following Equations (23) and (24) respectively, Equation (22) can be rewritten into following Equation (25).

$\begin{matrix} {X_{jk} = {\sum\limits_{v}{\sum\limits_{h}{t_{j}t_{k}}}}} & (23) \\ {Y_{j} = {\sum\limits_{v}{\sum\limits_{h}{t_{j}k_{vhi}}}}} & (24) \\ {{\begin{bmatrix} X_{00} & X_{01} & \cdots & X_{09} \\ X_{10} & X_{11} & \cdots & X_{19} \\ \vdots & \vdots & ⋰ & \vdots \\ X_{90} & X_{91} & \cdots & X_{99} \end{bmatrix}\begin{bmatrix} w_{10} \\ w_{11} \\ \vdots \\ w_{19} \end{bmatrix}} = \begin{bmatrix} Y_{0} \\ Y_{1} \\ \vdots \\ Y_{9} \end{bmatrix}} & (25) \end{matrix}$

This Equation (25) is also a normal equation. By solving the Equation (25) according to a general solution such as a sweeping method, the coefficient seed data w₁₀ to w_(n9) can be obtained.

FIG. 9 shows a configuration of a coefficient seed data production device 150′ for producing the coefficient seed data according to the concept shown in FIG. 8. In FIG. 9, constituent elements corresponding to those of FIG. 7 are denoted by the same reference numerals, and detailed descriptions thereof will be omitted.

The coefficient seed data production apparatus 150′ includes a normal equation production section 171 for producing a normal equation (see the Equation (20)) to be employed for obtaining coefficient data Wi (i=1 to n) for each class, from each HD pixel data y as target pixel data obtained from the HD signal received at the input terminal 151, prediction tap data (SD pixel data) xi selectively extracted in the first tap selection circuit 153 respectively in correspondence with each HD pixel data y, and the class code CL received from the class synthesis circuit 159 respectively in correspondence with each HD pixel data y.

In this case, learning data is produced in combination of one HD pixel data y and the prediction tap pixel data in the number of n corresponding to the HD pixel data y. The parameters H, V to be supplied to the position shift circuit 152B are sequentially changed so that 32 kinds of SD signal SD₁ to SD₃₂ can be sequentially produced, thus producing learning data between the HD signal and each SD signal respectively. As a result, in the normal equation production section 171, a normal equation for obtaining coefficient data Wi (i=1 to n) is produced for each class in correspondence with each SD signal.

The coefficient seed data production apparatus 150′ also includes a coefficient data decision section 172 for receiving data of the normal equation produced in the normal equation production section 171, and solving the normal equation so as to obtain coefficient data Wi for each class respectively corresponding to each SD signal, and a normal equation production section 173 for producing a normal equation (see the Equation (25)) for obtaining coefficient seed data w₁₀ to wn₉ for each class using the coefficient data Wi for each class respectively corresponding to each SD signal and the parameters H, V of the position shift values in the vertical direction and in the horizontal direction.

The coefficient seed data production apparatus 150′ also includes a coefficient seed data decision section 174 for receiving data of the normal equation produced for each class in the normal equation production section 173 and solving the normal equation for each class so as to obtain coefficient seed data w₁₀ to w_(n9) in each class, and a coefficient seed memory 162 for storing thus-obtained coefficient seed data w₁₀ to w_(n9).

The remaining constituent elements of the coefficient seed data production device 150′ shown in FIG. 9 have the same configuration as that of the coefficient seed data production device 150 shown in FIG. 7.

An operation of the coefficient seed data production apparatus 150′ shown in FIG. 9 will be described. An HD signal (1050 i signal) is supplied to the input terminal 151 as a teacher signal. Then, the HD signal is subjected to the thinning-out processing in the horizontal and vertical directions in the SD signal production circuit 152A so that an SD signal (525 i signal) as a student signal can be obtained. Thus-produced SD signal is supplied to the position shift circuit 152B where the position of the SD signal is shifted into 8 stages in the vertical direction and is shifted into 4 stages in the horizontal direction (see FIGS. 4 and 5), so that 32 kinds of SD signals SD₁ to SD₃₂ are sequentially produced.

In the second tap selection circuit 154, space class tap data (SD pixel data) located in periphery of the target position in the HD signal (1050 i signal) is selectively extracted from these SD signals SD₁ to SD₃₂. In the second tap selection circuit 154, the selection of tap is performed, based on the tap position information supplied from the tap selection control circuit 156, the tap position information corresponding to the movement class detected in the movement class detection circuit 158.

The resultant space class tap data (SD pixel data) is supplied to the space class detection circuit 157. In the space class detection circuit 157, each SD pixel data as the space class tap data is subjected to ADRC processing so that a re-quantized code qi as class information of the space class (a class sort mainly for the purpose of expressing the waveform in a space) can be obtained (see the Equation (1)).

In addition, in the third tap selection circuit 155, movement class tap data (SD image data) located in periphery of the target position in the HD signal is selectively extracted from the SD signals SD₁ to SD₃₂ obtained in the position shift circuit 152B. In this case, in the third tap selection circuit 155, the selection of the tap is performed, based on the tap position information supplied from the tap selection control circuit 156.

Thus-obtained movement class tap data (SD pixel data) is supplied to the movement class detection circuit 158. In the movement class detection circuit 158, class information MV about a movement class (a class sort mainly for the purpose of expressing the degree of movement) is obtained from each SD pixel data as movement class tap data.

Thus-obtained movement information MV and the aforementioned re-quantized code qi are supplied to the class synthesis circuit 159. In the class synthesis circuit 159, a class code CL showing a class including pixel data at the target position in the HD signal is obtained from the movement information MV and the re-quantized code qi (see the Equation (3)).

Further, in the first tap selection circuit 153, the prediction tap data (SD pixel data) located in periphery of the target position in the HD signal is selectively extracted from the SD signals SD₁ to SD₃₂ produced in the position shift circuit 152B. In this case, in the first tap selection circuit 153, the selection of tap is performed, based on the tap position information supplied from the tap selection control circuit 156.

In the normal equation production section 171, a normal equation (see the Equation (20)) to be employed for obtaining the coefficient data Wi (i=1 to n) is produced for each class respectively in correspondence with each SD signal produced in the SD signal production circuit 152, from each HD pixel data y as pixel data at the target position obtained from the HD signal received at the input terminal 151, prediction tap data (SD pixel data) xi selectively extracted in the first tap selection circuit 153 respectively in correspondence with each HD pixel data y, and the class code CL receiving from the class synthesis circuit 159 respectively in correspondence with each HD pixel data y.

Then, the normal equation is solved in the coefficient data decision section 172 so that coefficient data Wi for each class respectively corresponding to each DS signal can be obtained. In the normal equation production section 173, a normal equation (see the Equation (25)) employed for obtaining coefficient seed data w₁₀ to wn₉ is produced for each class, from the coefficient data Wi for each class respectively corresponding to each SD signal and the parameters H, V of the position shift values in the vertical direction and in the horizontal direction.

Then, the normal equation is solved in the coefficient seed data decision section 174 so that coefficient seed data w₁₀ to w_(n9) for each class can be obtained. The coefficient seed data w₁₀ to w_(n9) is stored in the coefficient seed memory 162 in which addresses are assigned for each class.

As described above, in the coefficient seed data production device 150′ shown in FIG. 9 as well, it is possible to produce the coefficient seed data w₁₀ to w_(n9) for each class stored in the information memory bank 135 of the image signal processing section 110 shown in FIG. 1.

In the image signal processing section 110 shown in FIG. 1, the production equation of the Equation (5) has been employed for producing the coefficient data Wi (i=1 to n). Alternatively, it is also possible to employ following Equation (26) or (27). Further alternatively, the coefficient data Wi also can be produced by employing a polynomial equation of different degrees or an equation expressed by another function. W ₁ =w ₁₀ +w ₁₁ v+w ₁₂ +h+w ₁₃ v ² +w ₁₄ h ² +w ₁₅ v ³ +w ₁₆ h ³ W ₂ =w ₂₀ +w ₂₁ v+w ₂₂ h+w ₂₃ v ² +w ₂₄ h ² +w ₂₅ v ³ +w ₂₆ h ³ . . . W ₁ =w ₁₀ +w ₁₁ v+w ₁₂ h+w ₁₃ v ² +w ₁₄ h ² +w ₁₅ v ³ +w ₁₆ h ³ . . . W _(n) =w _(n0) +w _(n1) v+w _(n2) h+w _(n3) v ² +w _(n4) h ² +w _(n5) v ³ w _(n6) h ³  (26) W ₁ =w ₁₀ +w ₁₁ v+w ₁₂ h+w ₁₂ h+w ₁₃ v ² +w ₁₄ vh+w ₁₅ h ² W ₂ =w ₂₀ +w ₂₁ v+w ₂₂ h+w ₂₃ v ² +w ₂₄ vh+w ₂₅ h ² . . . W ₁ =w ₁₀ +w ₁₁ v+w ₁₂ h+w ₁₃ v ² +w ₁₄ vh+w ₁₅ h ² . . . W _(n) =w _(n0) +w _(n1) v+w _(n2) h+w _(n3) v ² +w _(n4) vh+w _(n5) h ²  (27)

In addition, the processing performed in the image signal processing section 110 can be implemented in software, by use of an image signal processor such as the image signal processor 300 as shown in FIG. 10.

First, the image signal processor 300 shown in FIG. 10 will be described. The image signal processor 300 comprises a CPU 301 for controlling operations of the entire apparatus, a ROM (Read Only Memory) 302 for storing an operation program for the CPU 301, coefficient seed data, and the like, and a RAM (Random Access Memory) 303 for organizing a working area for the CPU 301. The CPU 301, ROM 302 and RAM 303 are connected to a bus 304, respectively.

The image signal processor 300 also comprises a hard disc drive (HDD) 305 as an external storage apparatus, and a disc drive (FDD) 307 for driving a Floppy (Trade Name) disc 306. These drives 305, 307 are connected to the bus 304, respectively.

The image signal processor 300 also comprises a communication section 308 for connecting to a communication network 400 such as the Internet through wired transmission or radio transmission. The communication section 308 is connected to the bus 304 via an interface 309.

The image signal processor 300 also comprises a user interface section. The user interface section includes a remote control signal receiving circuit 310 for receiving a remote control signal RM from a remote control transmitter 200, and a display 311 constituted by a liquid crystal display (LCD) and the like. The receiving circuit 310 is connected to the bus 304 via an interface 312, and similarly, the display 311 is connected to the bus 304 via the interface 313.

The image signal processor 300 also comprises an input terminal 314 for receiving a 525 i signal as an input image signal Vin, and an output terminal 315 for transmitting an output image signal Vout. The input terminal 314 is connected to the bus 304 via an interface 316, and similarly, the output terminal 315 is connected to the bus 304 via an interface 317.

The processing program, the coefficient seed data and the like may be, instead of being stored into the ROM 302 beforehand as described above, downloaded from the communication network 400 such as the Internet via the communication section 308 so as to be stored into the hard disc or the RAM 303, and then be used. Further, the processing program, the coefficient seed data and the like may be provided in the state of being stored in the Floppy (Trade Name) disc 306.

Further, the 525 i signal as the input image signal Vin may be, instead of being received through the input terminal 314, recorded in a hard disc beforehand, or may be downloaded from the communication network 400 such as the Internet via the communication section 308. In addition, the output image signal Vout may be, instead of or at the same time of being transmitted through the output terminal 315, supplied to the display 311 so as to display an image. Alternatively, the output image signal Vout signal may be stored in a hard disc, or may be transmitted to the communication network 400 such as the Internet via the communication section 308.

Referring to a flow chart of FIG. 11, a processing procedure for obtaining the output image signal Vout from an input image signal Vin in the image signal processor 300 shown in FIG. 10 will be described.

First, a processing starts in Step ST1. Then, in Step ST2, input image signals Vin are input in the unit of frame or in the unit of field. If the input image signals Vin are input through the input terminal 314, the RAM 303 temporarily stores the pixel data constituting the input image signal Vin. If the input image signals Vin are recorded on the hard disc, the input image signal Vin is read out of the hard disc drive 307 and then the RAM 303 temporarily stores the pixel data constituting the input image signal Vin. Then, in Step ST3, it is judged whether or not the processing of the input image signal Vin is finished for all frames or all fields. If the processing is finished, then the processing finishes in Step ST4. Contrarily, if the processing has not yet finished, then the procedure goes to Step ST5.

In Step ST5, position information h, v about each pixel within the unit pixel block constituting the output image signal Vout is generated using the value of n/m in compliance with the conversion method (including the magnification of an image to be displayed) selected by the user through operating the remote control transmitter 200. Then, in Step ST6, coefficient data Wi of the estimated equation (see the Equation (4)) for each class is produced corresponding to each pixel within the unit pixel block according to the production equation (for example, the Equation (5)) using the position information h, v about each pixel within the unit pixel block and the coefficient seed data for each class.

Next, in Step ST7, class tap data and prediction tap pixel data are obtained from the pixel data of the input image signal Vin input in Step ST2, in correspondence with each pixel data within the unit pixel block constituting the output image signal Vout to be produced. Then, in Step ST8, it is judged whether or not the processing for obtaining the pixel data of the output image signal Vout finishes in all the areas of the input pixel data of the input image signal Vin. If the processing finishes, then the procedure returns to the Step ST2 where the procedure goes to a processing of inputting input image signal Vin in the next frame or field. Contrarily, if the processing has not yet finished, then the procedure goes to Step ST9.

In Step ST9, a class code CL is produced from the pixel data of the class tap obtained in Step ST7. Then, in Step ST10, data of each pixel within the unit pixel block constituting the output image signal Vout is produced according to the estimated equation using the coefficient data corresponding to the produced class code CL and the SD pixel data of the prediction tap. After that, the procedure returns to the Step ST7 where the same processing as described above is repeated.

In the manner as described above, the pixel data of the input image signal Vin which has been input is processed by performing the processing in accordance with the flow chart shown in FIG. 11 so that the pixel data of the output image signal Vout can be obtained. As described above, the output image signal Vout obtained as a result of the processing is transmitted to the output terminal 315, or is supplied to the display 311 to display an image produced thereby. Alternatively, the output image signal Vout is supplied to the hard disc drive 305 to be recorded on the hard disc.

In addition, the processing in the coefficient seed data production device 150 shown in FIG. 7 can be implemented in software, although an illustration of the processing device thereof is omitted from the drawings.

Referring to the flow chart of FIG. 12, a processing procedure for producing coefficient seed data will be described.

First, a processing starts in Step ST21. Then, in Step ST22, position shift values (for example, specified by parameters H, V) of the SD signal to be used for learning are selected. Then, in Step ST23, it is judged whether or not the learning has been completed for all the position shift values. If the learning has not yet completed for all the position shift values, then the procedure goes to Step ST24.

In the Step ST24, already-known HD pixel data is input in the unit of frame or field. Then, in Step ST25, it is judged whether or not the processing has been completed for all the HD pixel data. If the processing is completed, then the procedure returns to the Step ST22 wherein the next position shift value is selected and the same processing as described above is repeated. Contrarily, if the processing has not yet completed, then the procedure goes to Step ST26.

In Step ST26, SD pixel data having a position shifted by the position shift value selected in the Step ST22 is produced from the HD pixel data which have been input in the Step ST24. Then, in Step ST27, pixel data of class tap and pixel data of prediction tap are obtained from the SD pixel data produced in the Step ST26, in correspondence with each HD pixel data input in the Step ST24. Then, in Step ST28, it is judged whether or not the learning has been completed for all the areas in the produced SD pixel data. If the learning is completed, then the procedure returns to the Step ST24 wherein the next HD pixel data is input and the same processing as described above is repeated. Contrarily, if the learning has not yet completed, then the procedure goes to Step ST29.

In the Step ST29, a class code CL is produced from the SD pixel data of the class tap obtained in the Step ST27. Then, in Step ST30, a normal equation (see the Equation (13)) is produced. After that, the procedure returns to the Step ST27.

If the learning is completed for all the position shift values in the Step ST23, then the procedure goes to Step ST31. In the Step ST31, the normal equation is solved by a method such as sweeping so that the coefficient seed data for each class can be obtained. Then, in Step ST32, thus-obtained coefficient seed data is stored in the memory. After that, the processing finishes in Step ST33.

As described above, the coefficient seed data for each class can be obtained in the same procedure as that employed in the coefficient seed data production device 150 shown in FIG. 7, through the processing along the flow chart shown in FIG. 12.

In addition, the processing in the coefficient seed data production device 150′ shown in FIG. 9 can be also implemented in software, although an illustration of the processing device thereof is omitted from the drawings.

Referring to the flow chart of FIG. 13, a processing procedure for producing coefficient seed data will be described.

First, a processing starts in Step ST41. Then, in Step ST42, position shift values (for example, specified by parameters H, V) of the SD signal to be used for learning are selected. Then, in Step ST43, it is judged whether or not a calculation processing for coefficient data has been finished for all the position shift values. If it has not yet finished, then the procedure goes to Step ST44.

In the Step ST44, already-known HD pixel data is input in the unit of frame or field. Then, in Step ST45, it is judged whether or not the processing has been completed for all the HD pixel data. If the processing has not yet completed, the procedure goes to Step ST46 wherein SD pixel data having a position shifted by the position shift value selected in the Step ST42 is produced from the HD pixel data which have been input in the Step ST44.

Then, in Step ST47, pixel data of class tap and pixel data of prediction tap are obtained from the SD pixel data produced in the Step ST46, in correspondence with each HD pixel data input in the Step ST44. Then, in Step ST48, it is judged whether or not the learning has been completed for all the areas in the produced SD pixel data. If the learning is completed, then the procedure returns to the Step ST44 wherein the next HD pixel data is input and the same processing as described above is repeated. Contrarily, if the learning has not yet completed, then the procedure goes to Step ST49.

In the Step ST49, a class code CL is produced from the SD pixel data of the class tap obtained in the Step ST47. Then, in Step ST50, a normal equation (see the Equation (20)) is produced to be used for obtaining coefficient data. After that, the procedure returns to the Step ST47.

If the processing is completed for all the HD pixel data in the Step ST45 described above, then the normal equation produced in the Step ST50 is solved by a method such as sweeping in Step ST51 wherein the coefficient data for each class can be obtained. After that, the procedure returns to the Step ST42 wherein the next position shift value is selected and the same processing as described above is repeated so that coefficient data corresponding to the next position shift value for each class can be obtained.

If the coefficient data has been obtained for all the position shift values in the Step ST43 described above, then the procedure goes to Step ST52. In the Step ST52, a normal equation (see the Equation (25)) employed for obtaining coefficient seed data is produced from the coefficient data with respect to all the position shift values.

Then, in Step ST 53, the normal equation produced in the Step ST52 is solved by a method such as sweeping so that the coefficient seed data for each class can be obtained. Then, in Step ST54, thus-obtained coefficient seed data is stored in the memory. After that, the processing finishes in Step ST55.

As described above, the coefficient seed data for each class can be obtained in the same procedure as that employed in the coefficient seed data production device 150′ shown in FIG. 9, through the processing along the flow chart shown in FIG. 13.

Although, in the embodiments described above, a linear equation is employed as the estimated equation for producing the HD signal, the present invention is not limited thereto. Alternatively, a high order polynomial equation may be employed as the estimated equation.

Further, in the embodiments described above, the class code CL is detected, and the coefficient data Wi corresponding to the detected class code is used in the estimated prediction calculation. However, it is also conceivable to omit the detected portion of the class code CL. In this case, only one kind of coefficient seed data is stored in the information memory bank 135.

Further, although, in the embodiments described above, the output image signal Vout transmitted from the image signal processing section 110 is supplied to the display section 11 wherein an image created by the output image signal Vout is displayed, the output image signal Vout may be supplied into a recording device such as a video tape recorder which records it. In this case, the output image signal Vout may be processed in the post-processing circuit 129 in such a manner as to have a data structure optimum for recording.

Further, in the embodiments described above, the 525 i signal as the input image signal Vin is converted into the 1080 i signal, the XGA signal, or the 525 i signal for obtaining an image to be displayed in a different magnification, as the output image signal Vout. However, the present invention is not limited thereto. It is a matter of course that the preset invention is similarly applicable to another cases where a first image signal is converted into a second image signal using an estimated equation.

Further, although the embodiments described above have showed the example where the information signal is an image signal, the present invention is not limited thereto. For example, the present invention is also applicable to a case where the information signal is a sound signal.

According to the present invention, when a first information signal is to be converted into a second information signal, position information about a target position in the second information signal is obtained from the information about format or size conversion; coefficient data of an estimated equation is produced from coefficient seed data, based on the resultant position information; and information data of the target position in the second information signal is obtained using thus-produced coefficient data. As a result, it becomes possible to eliminate a necessity of a memory for storing a large amount of coefficient data at the time of making conversions into various formats and sizes, and the apparatus can be structured at low cost.

Further, according to the present invention, the sum of the coefficient data of the estimated equation produced using the coefficient seed data is obtained, and then the information data of the target position produced by use of the estimated equation is normalized with dividing it by thus-obtained sum. As a result, it becomes possible to remove the fluctuations in the levels of the information data of the target position caused by a rounding error occurred when the coefficient data of the estimated equation is obtained according to the production equation using the coefficient seed data.

INDUSTRIAL APPLICABILITY

As described above, the information signal processor, the method for processing the information signal, the image signal processor and the image display apparatus using the same, the device for producing the coefficient seed data used for the same and its production method, and an information-providing medium according to the present invention are preferable for use in the case of converting a format such as a case where the 525 i signal is converted into the 1080 i signal, a case where the 525 i signal is converted into the XGA signal and the like, or converting an image size. 

1. An information signal processor for converting a first information signal including a plurality of information data into a second information signal including a plurality of information data, comprising: conversion information input means for inputting conversion information about a format or size conversion, said first information signal being different from said second information signal; information conversion means for converting the conversion information input by the conversion information input means into positional information about a target position in said second information signal; first memory means for storing coefficient seed data, said coefficient seed data being used in a production equation supplied with said positional information to produce coefficient data for use in an estimated equation; first data selection means for selecting a plurality of first information data located in a periphery of said target position in said second information signal, based on said first information signal; calculation means for calculating and obtaining information data of said target position based on said estimated equation using said coefficient data and said selected plurality of first information data; second data selection means for selecting a plurality of second information data located in a periphery of said target position in said second information signal, based on said first information signal; and class detection means for detecting a class at said target position, based on said second information data selected in said second data selection means.
 2. The information signal processor according to claim 1, wherein said first memory means stores said coefficient seed data obtained beforehand for each class detected in the class detection means, and wherein a coefficient data generation means generates coefficient data of the estimated equation corresponding to the class detected in said class detection means and the positional information about said target position.
 3. The information signal processor according to claim 2, wherein said coefficient data generation means includes: coefficient data production means for producing coefficient data of said estimated equation for each class detected in the class detection means according to said production equation using said coefficient seed data stored in said first memory means and the positional information about said target position obtained as a result of conversion by said information conversion means; second memory means for storing the coefficient data of said estimated equation in each class produced in said coefficient data production means; and coefficient data read means for reading the coefficient data of said estimated equation corresponding to the class detected by said class detection means out of said second memory means and transmitting the coefficient data after being read.
 4. The information signal processor according to claim 1, further comprising: addition means for obtaining a sum of the coefficient data of said estimated equation generated in a coefficient data generation means; and normalization means for normalizing with dividing the information data at said target position obtained in said calculation means by the sum obtained in said addition means.
 5. An image signal processor for converting a first image signal including a plurality of pixel data into a second image signal including a plurality of pixel data, comprising: conversion information input means for inputting conversion information about a format or size conversion, said first image signal being different from said second image signal; information conversion means for converting said conversion information input by said conversion information input means into positional information about a target position in said second image signal; memory means for storing coefficient seed data, said coefficient seed data being used in a production equation supplied with said positional information to produce coefficient data for use in an estimated equation; first data selection means for selecting a plurality of pixel data located in a periphery of the target position in said second image signal, based on said first image signal; calculation means for calculating and obtaining pixel data of said target position based on said estimated equation using said coefficient data and said selected plurality of pixel data; second data selection means for selecting a plurality of second pixel data located in a periphery of the target position in said second image signal, based on said first image signal; and class detection means for detecting a class at said target position, based on said plurality of second pixel data selected by said second data selection means.
 6. An image display apparatus comprising: image signal input means for inputting a first image signal including a plurality of pixel data; image signal processing means for converting the first image signal input from said image signal input means into a second image signal including a plurality of pixel data and for outputting the resultant second image signal; image display means for displaying an image produced by said second image signal received from said image signal processing means onto an image display element; and conversion information input means for inputting conversion information corresponding to a format or a size of the image displayed on said image display element, said first information signal being different from said second information signal, wherein the image signal processing means includes: information conversion means for converting said conversion information input by said conversion information input means into positional information about a target position in said second image signal; first memory means for storing coefficient seed data, said coefficient seed data being used in a production equation supplied with said positional information to produce coefficient data for use in an estimated equation; first data selection means for selecting a plurality of first pixel data located in a periphery of said target position in said second image signal, based on said first image information signal; calculation means for calculating and obtaining pixel data of said target position based on said estimated equation using said coefficient data and said selected plurality of first pixel data; second data selection means for selecting a plurality of second pixel data located in a periphery of the target position in said second image signal, based on said first image signal; and class detection means for detecting a class at said target position, based on said plurality of second pixel data selected by said second data selection means.
 7. The image display apparatus according to claim 6, wherein said first memory means stores said coefficient seed data obtained beforehand for each class detected in said class detection means, and wherein a coefficient data generation means generates coefficient data of said estimated equation corresponding to the class detected in said class detection means and the positional information about said target position.
 8. The image display apparatus according to claim 7, wherein said coefficient data generation means includes: coefficient data production means for producing coefficient data of said estimated equation for each class detected in said class detection means according to said production equation using said coefficient seed data stored in said first memory means and the positional information about said target position obtained as a result of conversion in said information conversion means; second memory means for storing the coefficient data of said estimated equation for each class produced in said coefficient data production means; coefficient data read means for reading the coefficient data of said estimated equation corresponding to the class detected by said class detection means out of said second memory means and transmitting the coefficient data after being read.
 9. The image display apparatus according to claim 6, further comprising: addition means for obtaining a sum of coefficient data of said estimated equation generated by said coefficient data generation means; and normalization means for normalizing with dividing the pixel data at said target position obtained in said calculation means by the sum obtained in said addition means.
 10. A method for processing an information signal for converting a first image signal including a first plurality of information data into a second image signal including a second plurality of information data, comprising: a first step of inputting conversion information about a format or size conversion, said first information signal being different from said second information signal; a second step of converting said conversion information input in the first step into positional information about a target position in the second image signal; a third step of providing coefficient seed data for use in a production equation supplied with said positional information to produce coefficient data for use in an estimated equation a fourth step of selecting a plurality of first information data located in periphery of the target position in said second information signal based on said first information signal; a fifth step of calculating and obtaining information data of said target position based on said estimated equation using said coefficient data and said selected plurality of first information data; a sixth step of selecting a plurality of second information data located in a periphery of the target position in said second information signal, based on said first information signal; and a seventh step of detecting a class at said target position, based on said plurality of second information data selected in the sixth step.
 11. The method for processing an information signal according to claim 10, wherein in the third step, the coefficient data of said estimated equation corresponding to the class detected in the seventh step and said positional information about said target position is produced.
 12. The method for processing an information signal according to claim 11, wherein the third step further comprises: a step of producing coefficient data of said estimated equation for each class according to said production equation for producing the coefficient data of the estimated equation obtained beforehand for each class detected in the seventh step using the coefficient seed data and the positional information about said target position obtained as a result of conversion in the second step, said coefficient seed data being coefficient data of the production equation; a step of storing the produced coefficient data of said estimated equation for each class into a memory means; and a step of reading said coefficient data of said estimated equation corresponding to the class detected in the seventh step out of the memory means and transmitting the read coefficient data.
 13. The method for processing an information signal according to claim 10, further comprising: an eighth step of obtaining a sum of coefficient data of said estimated equation; and a ninth step of normalizing with dividing said information data at said target position obtained in the fifth step by said sum obtained in the eighth step.
 14. An information-providing medium for providing a computer program for, in order to convert a first information signal including a first plurality of information data into a second information signal including a second plurality of information data, executing the steps of: a first step of inputting conversion information about a format or size conversion, said first information signal being different from said second information signal; a second step of converting said conversion information input in the first step into positional information about a target position in the second image signal; a third step of providing coefficient seed data for use in a production equation supplied with said positional information to produce coefficient data for use in an estimated equation a fourth step of selecting a plurality of first information data located in periphery of the target position in said second information signal based on said first information signal; a fifth step of calculating and obtaining information data of said target position based on said estimated equation using said coefficient data and the selected plurality of said first information data; a sixth step of selecting a plurality of second information data located in a periphery of the target position in said second information signal, based on said first information signal; and a seventh step of detecting a class at said target position, based on said plurality of second information data selected in the sixth step. 